A nearly linear-time approximation scheme for the euclidean k-median problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 378-389

  Kolliopoulos, Stavros G ^a   Rao, Satish ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GEOMETRY; POLYNOMIAL APPROXIMATION; STRUCTURAL OPTIMIZATION;

ADAPTIVE DECOMPOSITION; CLUSTERING PROBLEMS; FACILITY LOCATIONS; GEOMETRIC PROBLEMS; HIERARCHICAL DECOMPOSITIONS; LINEAR-TIME APPROXIMATION; POLYNOMIAL TIME APPROXIMATION SCHEMES; RANDOMIZED APPROXIMATION SCHEMES;

APPROXIMATION ALGORITHMS;

EID: 84958048640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_33     Document Type: Conference Paper

References (18)

1. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th FOCS, 2-11, 1996.
2. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 38th FOCS, 554-563, 1997.
3. S. Arora, P. Raghavan, and S. Rao. Polynomial time approximation schemes for the euclidean fc-medians problem. In Proc. 30th STOC, 106-113, 1998.
4. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th FOCS, 184-193, 1996.
5. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th STOC, 161-168, 1998.
6. M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner tree and fc-median. In Proc. 39th FOCS, 114-123, 1998.
7. M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant factor approximation algorithm for the k-median problem. To appear in Proc. STOC 99.
8. F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. In R. E. Bixby, E. A. Boyd, and R. Z. Rios-Mercado, editors, Proc. 6th IPCO, volume 1412 of LNCS, 180-194. Springer-Verlag, Berlin, 1998.
9. G. Cornuejols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990.
10. T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. In Proc. 20th STOC, 434-444, 1988.
11. T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
12. S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Proc. 9th SODA, 649-657, 1998.
13. D. S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22:148-162, 1982.
14. J. H. Lin and J. S. Vitter. Approximation algorithms for geometric median problems. Information Processing Letters, 44:245-249, 1992.
15. J. H. Lin and J. S. Vitter. e-approximations with minimum packing constraint violation. In Proc. 24th STOC, 771-782, 1992.
16. G. Mitchell. Guillotine subdvisions approximate polygonal subdivisions: Part II - A simple PTAS for geometric k-MST, TSP and related problems. Preliminary manuscript, April 30 1996. To appear in SIAM J. Computing.
17. S. Rao and W. D. Smith. Improved approximation schemes for geometrical graphs via spanners and banyans.In Proc. STOC, 540-550, 1998.
18. D. B. Shmoys, E. Tardos, and K. I. Aardal. Approximation algorithms for facility location problems. In Proc. STOC, 265-274, 1997.