Sciweavers

79 search results - page 2 / 16
» LP-based Approximation Algorithms for Capacitated Facility L...
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
14 years 11 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
TALG
2010
109views more  TALG 2010»
14 years 8 months ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos
JCSS
2010
146views more  JCSS 2010»
14 years 8 months ago
Connected facility location via random facility sampling and core detouring
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...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
89
Voted
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 months ago
Approximating connected facility location problems via random facility sampling and core detouring
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...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...