Improved approximation algorithms for capacitated facility location problems

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

Volumn 1610, Issue , 1999, Pages 99-113

  Chudak, Fabián A ^a   Williamson, David P ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COST BENEFIT ANALYSIS; COST FUNCTIONS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION;

ADDITIONAL COSTS; CAPACITATED FACILITY LOCATION PROBLEMS; LOCAL SEARCH HEURISTICS; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME ALGORITHMS; SIMPLIFIED ANALYSIS; SUPERMODULARITY; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 84948955787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_8     Document Type: Conference Paper

References (18)

1. S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 485-495, 1997.
2. Dj. A. Babayev. Comments on the note of Frieze. Mathematical Programming 7:249-252, 1974.
3. F. Barahona and D. Jensen. Plant location with minimum inventory. Mathematical Programming 83:101-111, 1998.
4. F. Chudak. Improved approximation algorithms for uncapacitated facility location. In Proceedings of the 6th IPCO Conference, pages 180-194, 1998.
5. F. Chudak and D.B. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem. In preparation.
6. F. Chudak and D.B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875-876, 1999.
7. G. Cornuéjols, G. Nemhauser, and L. 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, 1990.
8. U. Feige. A threshold of ln n for approximating set-cover. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 314-318, 1996.
9. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 649-657, 1998.
10. M. Korupolu, C. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 1998.
11. M. Korupolu, C. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Technical Report 98-30, DIMACS, June 1998. Available from dimacs.rutgers.edu/TechnicalReports/1998.html.
12. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976.
13. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. JACM 41:960-981, 1994.
14. P. Mirchandani and R. Francis, eds. Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990.
15. G.L. Nemhauser, L.A. Wolsey, and M.L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming 14:265-294, 1978.
16. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and a subconstant error-probability POP characterization of NP. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 475-484, 1997.
17. D. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th A CM Symposium on Theory of Computing, pages 265-274, 1997.
18. M. Sviridenko, July, 1998. Personal communication.