Improved Combinatorial Algorithms for Facility Location Problems
暂无分享,去创建一个
[1] A. Frieze,et al. A simple heuristic for the p-centre problem , 1985 .
[2] D. Hochbaum,et al. A best possible approximation algorithm for the k--center problem , 1985 .
[3] Jeffrey Scott Vitter,et al. Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..
[4] David P. Williamson,et al. Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.
[5] Judit Bar-Ilan,et al. How to Allocate Network Centers , 1993, J. Algorithms.
[6] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[7] Éva Tardos,et al. An approximation algorithm for the generalized assignment problem , 1993, Math. Program..
[8] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[9] Sudipto Guha,et al. Rounding via Trees : Deterministic Approximation Algorithms forGroup , 1998 .
[10] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[11] Kamesh Munagala,et al. Local search heuristic for k-median and facility location problems , 2001, STOC '01.
[12] Mohammad Mahdian,et al. Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.
[13] Fabián A. Chudak,et al. Improved approximation algorithms for a capacitated facility location problem , 1999, SODA '99.
[14] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[15] C. Greg Plaxton,et al. The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] Arie Tamir,et al. An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..
[17] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[18] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.
[19] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[20] Jiawei Zhang,et al. Approximation algorithms for facility location problems , 2004 .
[21] R. Ravi,et al. Bicriteria Network Design Problems , 1998, J. Algorithms.
[22] Evangelos Markakis,et al. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.
[23] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[24] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .
[25] 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).
[26] Satish Rao,et al. Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.
[27] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[28] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[29] Kamesh Munagala,et al. Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..
[30] Mikkel Thorup. Quick k-Median, k-Center, and Facility Location for Sparse Graphs , 2001, ICALP.
[31] Fabián A. Chudak,et al. Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..
[32] Samir Khuller,et al. The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..
[33] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[34] Piotr Indyk,et al. Sublinear time algorithms for metric space problems , 1999, STOC '99.
[35] Evangelos Markakis,et al. A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.
[36] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[37] 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.
[38] An A Fabii,et al. Improved Approximation Algorithms for Uncapacitated Facility Location , 1998 .
[39] R. Vohra,et al. The K-median Problem on a Tree , 2001 .
[40] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..