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

SIAM Journal on Computing

Volumn 34, Issue 2, 2005, Pages 405-432

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

center; median; Efficient approximation algorithms; Facility location; Location problems; Shortest paths

Indexed keywords

EFFICIENT APPROXIMATION ALGORITHMS; FACILITY LOCATION; K-CENTER; K-MEDIAN; LOCATION PROBLEMS; SHORTEST PATH;

ALGORITHMS; APPROXIMATION THEORY; INTERNET; LOCATION; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

GRAPH THEORY;

EID: 18444414341     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701388884     Document Type: Article

References (29)

1. M. CHARIKAR AND S. GUHA, Improved combinatorial algorithms for the facility location and κ-median problems, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, 1999, IEEE Press, Piscataway, NJ, pp. 378-388.
2. M. CHARIKAR, S. GUHA, E. TARDOS, AND D. B. SHMOYS, A constant-factor approximation algorithm for the κ-median problem, J. Comput. System Sci., 65 (2002), pp. 129-149.
3. E. COHEN, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
4. E. COHEN AND U. ZWICK, All-pairs small-stretch paths, J. Algorithms, 38 (2001), pp. 335-353.
5. R. COLE, R. HARIHARAN, M. LEWENSTEIN, AND E. PORAT, A faster implementation of the Goemans-Williamson clustering technique, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, SIAM, Philadelphia, 2001, pp. 17-25.
6. T. H. CORMEN, C. E. LEISERSON, AND R. L. RIVEST, Introduction to Algorithms, MIT Press/ McGraw-Hill, Cambridge, MA, New York, 1990.
7. M. R. GAREY AND D. S. JOHNSON, Computer and Intractability: A Guide to NP-Completeness, W. H. Freeman, San Francisco, 1979.
8. A. GOEL, P. INDYK, AND K. VARADARAJAN, Reductions among high dimensional proximity problems, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, SIAM, Philadelphia, 2001, pp. 769-778.
9. T. F. GONZALES, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci., 38 (1985), pp. 293-550.
10. S. GUHA, Approximation Algorithms for Facility Location Problems, Ph.D. thesis, Computer Science Department, Stanford University, Stanford, CA, 2000.
11. S. GUHA AND S. KHULLER, Greedy strikes back: Improved facility location algorithms, J. Algorithms, 31 (1999), pp. 228-248.
12. S. GUHA, M. MISHRA, R. MOTWANI, AND L. O'CALLAGHAN, Clustering data streams, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, IEEE Press, Piscataway, NJ, pp. 359-366.
13. D. HOCHBAUM AND D. B. SHMOYS, A unified approach to approximation algorithms for bottleneck problems, J. ACM, 33 (1986), pp. 533-550.
14. W. L. Hsu AND G. L. NEMHAUSER, Easy and hard bottleneck problems, Discrete Appl. Math., 1 (1979), pp. 209-216.
15. P. INDYK, Sublinear time algorithms for metric space problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, ACM, New York, pp. 428-434.
16. P. INDYK, High-Dimensional Computational Geometry, Ph.D. thesis, Computer Science Department, Stanford University, Stanford, CA, 2000.
17. P. INDYK AND R. MOTWANI, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, ACM, New York, pp. 604-613.
18. P. INDYK AND M. THORUP, Approximate 1-Medians, manuscript, 2000.
19. K. JAIN AND V. V. VAZIRANI, Approximation algorithms for metric facility location and κ-median problems using primal-dual and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
20. S. JAMIN, C. JIN, Y. JIN, D. RAZ, Y. SHAVITT, AND L. ZHANG, On the placement of Internet instrumentations, in Proceedings of the 19th INFOCOM meeting, Tel-Aviv, Israel, 2000, IEEE Press, Piscataway, NJ, pp. 26-30.
21. B. LI, M. GOLIN, G. G. ITALIANO, X. DENG, AND K. SOHRABY, On the optimal placement of web proxies in the Internet, in Proceedings of the 18th INFOCOM, New York, 1999, IEEE Press, Piscataway, NJ, pp. 1282-1290.
22. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
23. R. R. METTU AND C. G. PLAXTON, The online median problem, SIAM J. Comput., 32 (2003), pp. 816-832.
24. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, New York, 1995.
25. L. QIU, V. N. PADMANABHAN, AND G. M. VOELKER, On the optimal placement of web server replicas, in Proceedings of the 20th INFOCOM, Anchorage, AK, 2001, IEEE Press, Piscataway, NJ, pp. 1587-1596.
26. B. C. TANSEL, R. L. FRANCIS, AND T. J. LOWE, Location on networks: A survey. Parts 1 and 2, Management Sci., 29 (1983), pp. 482-511.
27. M. THORUP, Quick κ-median, κ-center, and facility location for sparse graphs, in Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 2076, 2001, Springer-Verlag, New York, pp. 249-260.
28. M. THORUP, Quick and good facility location, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, SIAM, Philadelphia, 2003, pp. 178-185.
29. M. THORUP AND U. ZWICK, Approximate distance oracles, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Crete, Greece, 2001, ACM, New York, pp. 183-192.