Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
暂无分享,去创建一个
[1] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[2] R. Ravi,et al. A Primal-Dual Approximation Algorithm for the Steiner Forest Problem , 1993, Inf. Process. Lett..
[3] Maxim Sviridenko. An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.
[4] Yossi Azar,et al. Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[5] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[6] 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).
[7] Vijay V. Vazirani,et al. Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[8] R. Ravi,et al. Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..
[9] Sudipto Guha,et al. A constant factor approximation for the single sink edge installation problems , 2001, STOC '01.
[10] Kunal Talwar,et al. The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.
[11] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[12] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[13] R. Ravi,et al. On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem , 2001, IPCO.
[14] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[15] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[16] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[17] Mohammad Mahdian,et al. A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem , 2003, RANDOM-APPROX.
[18] Sudipto Guha,et al. Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[19] R. Ravi,et al. Approximation algorithms for a capacitated network design problem , 2000, APPROX.
[20] Kamesh Munagala,et al. Local search heuristic for k-median and facility location problems , 2001, STOC '01.
[21] R. Ravi,et al. Buy-at-bulk network design: approximating the single-sink edge installation problem , 1997, SODA '97.
[22] David R. Karger,et al. Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[23] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[24] Lisa Zhang,et al. The access network design problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).