220 search results - page 2 / 44 » Primal-Dual Algorithms for Connected Facility Location Probl... |
73
Voted
JCSS
2010
14 years 8 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
JCO
2008
14 years 9 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
COCOA
2007
Springer
14 years 11 months ago
2007
Springer
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
147
Voted
SODA
2012
ACM
12 years 12 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...