Quick k-Median, k-Center, and Facility Location for Sparse Graphs

Authors:
Mikkel Thorup
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 15
Cited 7

A unified approach to approximation algorithms for bottleneck problems

Journal of the ACM (JACM)
A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Size-estimation framework with applications to transitive closure and reachability

Journal of Computer and System Sciences
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
All-pairs small-stretch paths

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Reductions among high dimensional proximity problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On RAM Priority Queues

SIAM Journal on Computing
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The online median problem

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Clustering data streams

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Experimental Evaluation of a New Shortest Path Algorithm

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Performance Guarantees for Hierarchical Clustering

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Performance guarantees for hierarchical clustering

Journal of Computer and System Sciences - Special issue on COLT 2002
Optimal time bounds for approximate clustering

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A new template for solving p-median problems for trees in sub-quadratic time

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved approximation algorithms for multilevel facility location problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Solving an open problem of Jain and Vazirani [FOCS'99], we present Õ (n+m) time constant factor approximation algorithms for the k-median, k-center, and facility location problems with assignment costs being shortest path distances in a weighted undirected graph with n nodes and m edges. For all of these location problems, Õ(n2) algorithms were already known, but here we are addressing large sparse graphs. An application could be placement of content distributing servers on the Internet. The Internet is large and changes so frequently that an Õ(n2) time solution would likely be outdated long before completion.