Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
| Hi-index | 0.00 |
In the mobile facility location problem, which is a variant of the classical facility location, each facility and client is assigned to a start location in a metric graph and our goal is to find a destination node for each client and facility such that every client is sent to a node which is the destination of some facility. The quality of a solution can be measured either by the total distance clients and facilities travel or by the maximum distance traveled by any client or facility. As we show in this article (by an approximation-preserving reduction), the problem of minimizing the total movement of facilities and clients generalizes the classical k-median problem. The class of movement problems was introduced by Demaine et al. [2007] where a simple 2-approximation was proposed for the minimum maximum movement mobile facility location problem while an approximation for the minimum total movement variant and hardness results for both were left as open problems. Our main result here is an 8-approximation algorithm for the minimum total movement mobile facility location problem. Our algorithm is obtained by rounding an LP relaxation in five phases. For the minimum maximum movement mobile facility location problem, we show that we cannot have a better than a 2-approximation for the problem, unless P=NP so the simple algorithm proposed by Demaine et al. [2007] is essentially best possible.