Improved Approximation Algorithms for Metric Facility Location Problems
暂无分享,去创建一个
[1] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[2] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[3] Fabián A. Chudak. Improved Approximation Algorithms for Uncapitated Facility Location , 1998, IPCO.
[4] Sudipto Guha,et al. Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[5] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[6] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[7] David B. Shmoys,et al. Approximation algorithms for facility location problems , 2000, APPROX.
[8] David P. Williamson,et al. Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.
[9] Dorit S. Hochbaum,et al. Heuristics for the fixed cost median problem , 1982, Math. Program..
[10] Fabián A. Chudak,et al. Improved approximation algorithms for a capacitated facility location problem , 1999, SODA '99.
[11] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[12] Maxim Sviridenko. An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.
[13] Evangelos Markakis,et al. A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.
[14] Klaus Jansen,et al. Approximation Algorithms for Combinatorial Optimization , 2000 .