268 search results - page 4 / 54 » Facility location: distributed approximation |
IPCO
2010
13 years 6 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
STOC
2005
ACM
14 years 8 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
2008
Springer
13 years 7 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
APPROX
2000
Springer
14 years 4 days ago
2000
Springer
CIAC
2006
Springer
13 years 11 months ago
2006
Springer