Sciweavers

129 search results - page 1 / 26
» Algorithms for facility location problems with outliers
Sort
View
SODA
2001
ACM
163views Algorithms» more  SODA 2001»
13 years 6 months ago
Algorithms for facility location problems with outliers
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...
Moses Charikar, Samir Khuller, David M. Mount, Gir...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 6 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...
ALGORITHMICA
2004
103views more  ALGORITHMICA 2004»
13 years 5 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
TALG
2010
109views more  TALG 2010»
13 years 3 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»
13 years 3 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...