A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
暂无分享,去创建一个
[1] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[2] Yair Bartal,et al. On approximating arbitrary metrices by tree metrics , 1998, STOC '98.
[3] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[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] Satish Rao,et al. Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.
[6] Dorit S. Hochbaum,et al. Heuristics for the fixed cost median problem , 1982, Math. Program..
[7] Jeffrey Scott Vitter,et al. Approximation Algorithms for Geometric Median Problems , 1992, Inf. Process. Lett..
[8] Éva Tardos,et al. Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.
[9] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[10] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[11] Sudipto Guha,et al. Rounding via Trees : Deterministic Approximation Algorithms forGroup , 1998 .
[12] Satish Rao,et al. Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.
[13] D. Warren,et al. Improved Approximation Schemes for Geometrical Graphs Via Spanners and Banyans , 1998, STOC 1998.
[14] 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.
[15] An A Fabii,et al. Improved Approximation Algorithms for Uncapacitated Facility Location , 1998 .
[16] Bruce W. Char,et al. Maple V Language Reference Manual , 1993, Springer US.
[17] Sanjeev Arora,et al. Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.
[18] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.
[19] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[20] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[21] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .
[22] Sudipto Guha,et al. A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.
[23] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.