Sciweavers

667 search results - page 2 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
14 years 2 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
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 6 days 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
ALGORITHMICA
2004
103views more  ALGORITHMICA 2004»
13 years 9 months ago
Primal-Dual Algorithms for Connected Facility Location Problems
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
Chaitanya Swamy, Amit Kumar
WINE
2010
Springer
149views Economy» more  WINE 2010»
13 years 7 months ago
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
Dimitris Fotakis, Christos Tzamos
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 4 months 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