Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Clustering for metric and non-metric distance measures
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Small space representations for metric min-sum k-clustering and their applications
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Clustering for metric and nonmetric distance measures
ACM Transactions on Algorithms (TALG)
Fast approximation in subspaces by doubling metric decomposition
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online and incremental algorithms for facility location
ACM SIGACT News
Property testing
Property testing
Memoryless facility location in one pass
ACM Transactions on Algorithms (TALG)
Fast clustering using MapReduce
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Memoryless facility location in one pass
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We present $\tilde{O}(m)$ time and space 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 vertices and m edges. For all of these location problems, $\tilde{O}(n^2)$ time and space 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 $\tilde{O}(n^2)$ time solution would likely be outdated long before completion.