Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
暂无分享,去创建一个
[1] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[2] Karen Aardal,et al. A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem , 1999, Inf. Process. Lett..
[3] Sudipto Guha,et al. Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[4] David B. Shmoys,et al. Approximation algorithms for facility location problems , 2000, APPROX.
[5] Kamesh Munagala,et al. Cost-distance: two metric network design , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[6] Adriana Felicia Gabor,et al. A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem , 2001, RANDOM-APPROX.
[7] Evangelos Markakis,et al. A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.
[8] W. Kern,et al. A simple dual ascent algorithm for the multilevel facility location problem , 2001, Electron. Notes Discret. Math..
[9] Alexander A. Ageev. Improved approximation algorithms for multilevel facility location problems , 2002, Oper. Res. Lett..
[10] Mohammad Mahdian,et al. Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.
[11] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.