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...
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...
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 ...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
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...