Sciweavers

268 search results - page 6 / 54
» Facility location: distributed approximation
Sort
View
SIGECOM
2003
ACM
92views ECommerce» more  SIGECOM 2003»
15 years 2 months ago
Strategyproof cost-sharing mechanisms for set cover and facility location games
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
Nikhil R. Devanur, Milena Mihail, Vijay V. Vaziran...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
15 years 9 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
105
Voted
FOCS
2008
IEEE
14 years 10 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
14 years 9 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
TALG
2010
123views more  TALG 2010»
14 years 7 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina