Sciweavers

207 search results - page 2 / 42
» Improved Approximation Algorithm for Connected Facility Loca...
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 10 days ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
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 ...
Sara Ahmadian, Chaitanya Swamy
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
13 years 9 months ago
An approximation algorithm for the fault tolerant metric facility location problem
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...
Kamal Jain, Vijay V. Vazirani
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 6 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 5 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 7 months ago
Constant factor approximation algorithm for the knapsack median problem
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...
Amit Kumar