74 search results - page 1 / 15 » A 1.488 Approximation Algorithm for the Uncapacitated Facili... |
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
SODA
2004
ACM
13 years 6 months ago
2004
ACM
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, ...
JMLR
2010
12 years 11 months ago
2010
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...