Quick and good facility location

Authors:
Mikkel Thorup
Affiliations:
AT&T Labs---Research, Florham Park, NJ
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 9
Cited 9

Introduction to algorithms

Introduction to algorithms
Size-estimation framework with applications to transitive closure and reachability

Journal of Computer and System Sciences
Sublinear time algorithms for metric space problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Journal of Algorithms
A faster implementation of the Goemans-Williamson clustering algorithm

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A new greedy approach for facility location problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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

Approximation algorithms for hierarchical location problems

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On optimal service selection

WWW '05 Proceedings of the 14th international conference on World Wide Web
Approximation algorithms for hierarchical location problems

Journal of Computer and System Sciences - Special issue on network algorithms 2005
An Optimized Clustering and Selective Probing Framework to Support Internet Quality-of-Service Routing

Simulation
Algorithms for sensor and ad hoc networks: advanced lectures

Algorithms for sensor and ad hoc networks: advanced lectures
Fast approximation in subspaces by doubling metric decomposition

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Fast bounding procedures for large instances of the Simple Plant Location Problem

Computers and Operations Research
Deterministic sublinear-time approximations for metric 1-median selection

Information Processing Letters
A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the facility location problem with shortest path distances in a weighted graph. W.h.p., we get an approximation factor of 1.62 in O(n + m) time with n and m the number of nodes and edges. Also, as a kind of warm-up, for a metric with a constant-times distance oracle, we get the factor 1.62 deterministically in O(n2 log n) time.Our results build on a recent facility location algorithm of Jain, Mahdian, and Saberi (STOC'02) achieving an approximation factor of 1.61 in O(n3) time.