The power of priority algorithms for facility location and set cover

Algorithmica (New York)

Volumn 40, Issue 4, 2004, Pages 271-291

  Angelopoulos, Spyros ^a   Borodin, Allan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximation lower bounds; Greedy algorithms

Indexed keywords

APPROXIMATION THEORY; DECISION THEORY; LOCATION; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; SET THEORY;

APPROXIMATION LOWER BOUNDS; APPROXIMATION RATIO; FACILITY LOCATION; GREEDY ALGORITHMS;

ALGORITHMS;

EID: 21044437197     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1113-2     Document Type: Conference Paper

References (24)

1. S. Angelopoulos. Randomized priority algorithms. In Proceedings of the 1st International Workshop on Approximation and Online Algorithms, pages 27-40, 2003.
2. S. Angelopoulos. Ordering-preserving transformations and greedy-like algorithms. To appear in 2nd Workshop on Approximation and Online Algorithms, September 2004.
3. S. Arora, B. Bollobás, and L. Lovász. Proving integrality gaps without knowing the linear program. In Proceedings of the 43rd Annual IEEE Conference on Foundations of Computer Science, pages 313-322, 2002.
4. S. Arora and M. Sudan. Improved low degree testing and its applications. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 485-495, 1997.
5. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating throughput in real-time scheduling. SIAM Journal of Computing, 31(2):331-352, 2001.
6. A. Borodin, M. Nielsen, and C. Rackoff. (Incremental) priority algorithms. Algorithmica, 37:295-326, 2003.
7. V. Chvátal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233-235, 1979.
8. S. Davis and R. Impagliazzo. Models of greedy algorithms for graph problems. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pages 381-390, 2004.
9. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
10. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 649-657, 1998.
11. S. Guha, N. Mishra, R. Motwahi, and L. O'Callaghan. Clustering data streams. In Proceedings of the 41st Annual IEEE Conference on Foundations of Computer Science, pages 359-366, 2000.
12. D. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22:148-162, 1982.
13. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computation, pages 731-740, 2002.
14. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48(2):274-296, 2001.
15. D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3):256-278, 1974.
16. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. SIAM Journal on Computing, 28(1):164-191, 1999.
17. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
18. M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 127-137, 2001.
19. M. Mahdian, J. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). pages 229-242, 2002.
20. R.R. Mettu and C.G. Plaxton. The online median problem. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 339-348, 2000.
21. A. Meyerson. Online facility location. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 426-431, 2001.
22. D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combinatorial Optimization. Volume 1913 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
23. D.B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems (extended abstract). In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. pages 265-274, 1997.
24. P. Slavík. A tight analysis of the greedy algorithm for set cover. Journal of Algorithms. 25:237-254, 1997.