Highly Influenced

19 Excerpts

- Published 2001 in FOCS

We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized onlineO(1)-competitive algorithm in the case where points arrive in random order. If points are ordered adversarially, we show that no algorithm can be constant-competitive, and provide an O(logn)-competitive algorithm. Our algorithms are randomized and the analysis depends heavily on the concept of expected waiting time. We also combine our techniques with those of Charikar and Guha to provide a linear-time constant approximation for the offline facility location problem.

Citations per Year

Semantic Scholar estimates that this publication has **176** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 108 extracted citations

Highly Influenced

19 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

20 Excerpts

Highly Influenced

11 Excerpts

Highly Influenced

14 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

8 Excerpts

@inproceedings{Meyerson2001OnlineFL,
title={Online Facility Location},
author={Adam Meyerson},
booktitle={FOCS},
year={2001}
}