5595 search results - page 40 / 1119 » Approximation Algorithms for Clustering Problems |
203
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
125
Voted
ICCS
2003
Springer
15 years 7 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
142
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
121
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
137
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...