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...
Moses Charikar, Samir Khuller, David M. Mount, Gir...
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
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 ...