306 search results - page 3 / 62 » Parallel approximation algorithms for facility-location prob... |
CIAC
2006
Springer
13 years 9 months ago
2006
Springer
SODA
2004
ACM
13 years 7 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, ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
JMLR
2010
13 years 17 days 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...
SODA
2001
ACM
13 years 7 months ago
2001
ACM
d Abstract) Moses Charikar Samir Khullery David M. Mountz Giri Narasimhanx Facility location problems are traditionally investigated with the assumption that all the clients are t...