Improved approximation algorithms for uncapacitated facility location

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 180-194

  Chudak, Fabián A ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COSTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOCATION; OPTIMIZATION;

DECOMPOSITION TECHNIQUE; FRACTIONAL SOLUTIONS; LINEAR PROGRAMMING RELAXATION; LINEAR PROGRAMS; OPTIMAL SOLUTIONS; RANDOMIZED ROUNDING; TRIANGLE INEQUALITY; UNCAPACITATED FACILITY LOCATIONS;

APPROXIMATION ALGORITHMS;

EID: 84958757894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_14     Document Type: Conference Paper

References (12)

1. A. A. Ageev and M. I. Sviridenko. An approximation algorithm for the uncapacitated facility location problem. Manuscript, 1997
2. M. L. Balinski. Integer programming: Methods, uses, computation. Management Science, 12(3):253-313, 1965
3. G. Cornuéjols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Manage- ment Science, 23(8):789-810, 1977
4. G. Cornuéjols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119-171. John Wiley and Sons, Inc., New York, 1997
5. U. Feige. A threshold of ln n for approxiamting set-cover. In 28th ACM Symposium on Theory of Computing, pages 314-318, 1996
6. M. X. Goemans and D. P. Williamson. New 3/4-approximation algorithms for max-sat. SIAM Journal on Discrete Mathematics, 7:656-666, 1994
7. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998. To appear
8. J. H. Lin and J. S. Vitter. ε-Approximation with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Com- puting, pages 771-782, 1992
9. P. Mirchandani and R. Francis, editors. Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990
10. P. Raghavan and C. D. Thompson. Randomized rounding. Combinatorica, 7:365-374, 1987
11. D. B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In 29th ACM Symposium on Theory of Computing, pages 265-274, 1997
12. M. I. Sviridenko. Personal communication, July 1997.