A simple and deterministic competitive algorithm for online facility location

Authors:
Aris Anagnostopoulos;Russell Bent;Eli Upfal;Pascal Van Hentenryck
Affiliations:
Department of Computer Science, Brown University, Box 1910, Providence, RI;Department of Computer Science, Brown University, Box 1910, Providence, RI;Department of Computer Science, Brown University, Box 1910, Providence, RI;Department of Computer Science, Brown University, Box 1910, Providence, RI
Venue:
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Year:
2004

Citing 15
Cited 2

Amortized efficiency of list update and paging rules

Communications of the ACM
Randomized algorithms

Randomized algorithms
Approximation algorithms for facility location problems (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for a capacitated facility location problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional binary search trees used for associative searching

Communications of the ACM
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Searching in metric spaces

ACM Computing Surveys (CSUR)
Finding nearest neighbors in growth-restricted metrics

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A constraint-based architecture for local search

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Improved Approximation Algorithms for Metric Facility Location Problems

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Comet in context

PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
The online median problem

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

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the competitive ratio for online facility location

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Incremental algorithms for facility location and k-Median

Theoretical Computer Science - Approximation and online algorithms
A primal-dual algorithm for online non-uniform facility location

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region, or only at customer sites, or only at fixed locations. The paper shows that the algorithm is O(log n)-competitive under these various models, where n is the total number of customers. It also shows that the algorithm is O(1)-competitive with high probability and for any arrival order when customers are uniformly distributed or when they follow a distribution satisfying a smoothness property. Experimental results for a variety of scenarios indicate that the algorithm behaves extremely well in practice.