33 search results - page 2 / 7 » Improved Primal-Dual Approximation Algorithm for the Connect... |
JCSS
2010
13 years 4 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
13 years 5 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...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
APPROX
2000
Springer
13 years 10 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...
SODA
2012
ACM
11 years 8 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...