Quick k-median, k-center, and facility location for sparse graphs

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

Volumn 2076 LNCS, Issue , 2001, Pages 249-260

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; LOCATION; COMPUTATIONAL LINGUISTICS; INTERNET; PROBLEM SOLVING;

FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; K-MEDIAN; LOCATION PROBLEMS; SHORTEST PATH; SPARSE GRAPHS; TIME CONSTANTS; WEIGHTED UNDIRECTED GRAPH; K-CENTER;

GRAPH THEORY;

EID: 84879542731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_21     Document Type: Conference Paper

References (19)

1. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31th STOC, pages 1-10, 1999.
2. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. System Sci. , 55(3):441-453, 1997.
3. E. Cohen and U. Zwick. All-pairs small-stretch paths. In Proc. 8th SODA, pages 93-102, 1999.
4. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34:596-615, 1987.
5. A. Goel, P. Indyk, and K. Varadarajan. Reductions among high demensional proximity problems. In Proc. 10th SODA, pages 769-778, 2001.
6. T. F. Gonzales. Clustering to minimize the maximum intercluster distance. Theor. Comp. Sci. , 38:293-550, 1985.
7. S. Guha, M. Mishra, R. Motwani, and L O'Callaghan. Clustering data streams. In Proc. 41th FOCS, pages 359-366, 2000.
8. D. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. J. ACM, 33:533-550, 1986.
9. W. L. Hsu and G. L. Nemhauser. Easy and hard bottleneck problems. Discr. Appl. Math. , 1:209-216, 1979.
10. P. Indyk. Sublinear time algorithms for metric space problems. In Proc. 31th STOC, pages 428-434, 1999.
11. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the course of dimensionality. In Proc. 30th STOC, pages 604-613, 1998.
12. P. Indyk and M. Thorup. Approximate 1-medians, 2000.
13. K. Jain and V. V. Vazirani. Primal-dual approximation algorihtms for metric facility location and k-median problems. In Proc. 40th FOCS, pages 2-13, 1999. The running times involve a certain factor L that will be removed in the journal version to appear in J. ACM.
14. M. Luby. A simple parallel algorithm for the maiximal independent set. SIAM J. Comput. , 15:1036-1053, 1986.
15. R. R. Mettu and C. G. Plaxton. The online medan problem. In Proc. 41th FOCS, pages 339-348, 2000.
16. B. C. Tansel, R. L. Francis, and T. J. Lowe. Location on networks: A survey. part 1 and 2. Management Science, 29(4):482-511, 1983.
17. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. ACM, 46:362-394, 1999.
18. M. Thorup. On RAM priority queues. SIAM J. Comput. , 30(1):86-109, 2000.
19. M. Thorup and U. Zwick. Approximate distance oracles, 2000. Accepted for STOC'01.