Sciweavers

56 search results - page 1 / 12
» An optimal bifactor approximation algorithm for the metric u...
Sort
View
JMLR
2010
164views more  JMLR 2010»
12 years 11 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 5 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
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
13 years 10 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
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
13 years 6 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