207 search results - page 5 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
CIAC
2006
Springer
14 years 1 months ago
2006
Springer
SODA
2004
ACM
13 years 11 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, ...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
JMLR
2010
13 years 4 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...