206 search results - page 4 / 42 » Constant factor approximation algorithm for the knapsack med... |
TALG
2010
13 years 7 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
ICASSP
2008
IEEE
13 years 12 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...