Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SIAM Journal on Computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
SIAM Journal on Computing
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
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: exponential speed-up of local algorithms using non-local communication
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Rapid randomized pruning for fast greedy distributed algorithms
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A 1.488 approximation algorithm for the uncapacitated facility location problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
This paper presents a distributed O(1)-approximation algorithm in the $\mathcal{CONGEST}$ model for the metric facility location problem on a size-n clique network that has an expected running time of O(loglogn ·log*n) rounds. Though metric facility location has been considered by a number of researchers in low-diameter settings, this is the first sub-logarithmic-round algorithm for the problem that yields an O(1)-approximation in the setting of non-uniform facility opening costs. Since the facility location problem is specified by Ω(n2) bits of information, any fast solution in the $\mathcal{CONGEST}$ model must be truly distributed. Our paper makes three main technical contributions. First, we show a new lower bound for metric facility location. Next, we demonstrate a reduction of the distributed metric facility location problem to the problem of computing an O(1)-ruling set of an appropriate spanning subgraph. Finally, we present a sub-logarithmic-round (in expectation) algorithm for computing a 2-ruling set in a spanning subgraph of a clique. Our algorithm accomplishes this by using a combination of randomized and deterministic sparsification.