Minimizing movement in mobile facility location problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 357-366

  Friggstad, Zachary ^a   Salavatipour, Mohammad R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; FACILITIES; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION; SITE SELECTION;

DESTINATION NODES; HARDNESS RESULTS; MAXIMUM DISTANCES; MEDIAN PROBLEMS; MOBILE FACILITIES; OPEN PROBLEMS; SIMPLE ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 57949098325     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.12     Document Type: Conference Paper

References (22)

1. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, Local search heuristics for k-median and facility location problems, SIAM J. Comput. 33 (2004), pp. 544-562.
2. Y. Bartal, On approximating arbitrary metrics by tree metrics, in Proc. of the 29th annual ACM Symp. on Theory of Computing (STOC), 1997, pp. 161-168.
3. J.L. Bredin, E. Demaine, M.T. Hajiaghayi, and D. Rus, Deploying sensor networks with guaranteed capacity and fault tolerance, in Proc. of the 6th annual ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2005, pp. 309-319.
4. Jaroslaw Byrka, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, In Proceedings of APPROX 2007.
5. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location and k-median problems, in Proc. of the 40th Annual IEEE Symp. on Foundations of Comp. Sci. (FOCS), 1999, pp. 378-388.
6. M. Charikar, S. Guha, D. Shmoys, and E. Tardos, A constant factor approximation algorithm for the k-median problem, in Proc. of the 31st annual ACM Symp. on Theory of Computing (STOC), 1999, pp. 1-10.
7. F. Chudak and D.B. Shmoys, Improved approximation algorithms for uncapacitated facility location problem, SIAM J. Comput, 33 (2003), pp. 1-25.
8. E. Demaine, M. Hajiaghayi, H. Mahini, A. Sayid-Roshkar, S. Oveisgharan, and M. Zadimoghaddam, Minimizing movement, In Proc. of the 18th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007, pp. 258-267.
9. N. Devanur, N. Garg, R. Khandekar, V. Pandit, A. Saberi, and V. V. Vazirani, Price of Anarchy, Locality Gap, and a Network Service Provider Game, In Proceedings, 1st Workshop on Internet and Network Economics (WINE), Lecture Notes in Computer Science 3828, pages 1046-1055, 2005.
10. J. Fakcharoenphol, S. Rao, and K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, JCSS, 69 (2004), pp. 485-497. Preliminary version in Proc. 35th Annual ACM Symp. on Theory of Computing (STOC), 2003.
11. S. Guha and S. Khuller, Greedy strikes back: improved facility location algorithms, in Proc. of the 9th annual ACM-SIAM Symp. on Discrete Algorithms (SODA), 1998, pp. 649-657.
12. D. Hochbaum, Heuristics for the fixed cost median problem, Mathematical Programming, 22 (1982), pp. 148-162.
13. T-R. Hsiang, E.M. Arkin, M. Bender, S. Fekete, and J.S. Mitchell, Algorithms for rapidly dispersing robot swarms in unknown environments, in Proc. of the 5th Workshop on Algorithmic Foundations of Robotics (WAFR), 2002, pp. 77-94.
14. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani, Approximation algorithms for facility location via dual fitting with factor-revealing LP, J. ACM, 50 (2003), pp. 795-824.
15. K. Jain, M. Mahdian, and A. Saberi, A new greedy approach for facility location problems, in Proc. of the 34th annual ACM Symp. on Theory of Computing (STOC), 2002, pp. 731-740.
16. K. Jain and V.V. Vazirani, Approximation algorithms for metric facility location and kmedian problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
17. R. Karp, Reducibility among combinatorial problems, In Raymond E. Miller and James W. Thatcher, editors Complexity of Computer Computations, 85-103, Plenum Press, 1972.
18. M. Mahdian and M. Pal, Universal facility location, in Proc. of the 11th annual European Symp. on Algorithms (ESA), 2003, pp. 409-421.
19. M. Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM J. Comput., 36 (2006), pp. 411-432.
20. A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, New York, 2005.
21. D. Shmoys, É. Tardos, and K. Aardal, Approximation algorithms for facility location problems, in Proc. of the 29th annual ACM Symp. on Theory of Computing (STOC), 1997, pp. 265-274.
22. M. Sviridenko, An improved approximation algorithm for the metric uncapacitated facility location problem, in Proc. of 9th Inter. Conf. on Integer Programming and Combinatoril Optimization (IPCO) 2002, pp. 240-257.