3874 search results - page 107 / 775 » Approximation Algorithms for k-hurdle Problems |
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
116
click to vote
COMGEO
2004
ACM
14 years 9 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...