Sciweavers

79 search results - page 5 / 16
» LP-based Approximation Algorithms for Capacitated Facility L...
Sort
View
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
82
Voted
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
15 years 3 months ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
PODC
2005
ACM
15 years 3 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
14 years 9 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin