220 search results - page 6 / 44 » Primal-Dual Algorithms for Connected Facility Location Probl... |
SODA
2001
ACM
13 years 8 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...
JMLR
2010
13 years 2 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...
STOC
2005
ACM
14 years 7 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...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
