Sciweavers

207 search results - page 4 / 42
» Improved Approximation Algorithm for Connected Facility Loca...
Sort
View
111
Voted
DAM
2010
120views more  DAM 2010»
15 years 2 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
145
Voted
SAINT
2008
IEEE
15 years 9 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
127
Voted
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 3 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
99
Voted
APPROX
2000
Springer
126views Algorithms» more  APPROX 2000»
15 years 7 months ago
Approximation algorithms for facility location problems
David B. Shmoys