Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Clustering to minimize the sum of cluster diameters
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for facility location problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
SIAM Journal on Computing
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Algorithms for dynamic geometric problems over data streams
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
SIAM Journal on Computing
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved Combinatorial Algorithms for Facility Location Problems
SIAM Journal on Computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Incremental algorithms for facility location and k-Median
Theoretical Computer Science - Approximation and online algorithms
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Facility Location in Dynamic Geometric Data Streams
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Approximate mechanism design without money
Proceedings of the 10th ACM conference on Electronic commerce
SIAM Journal on Computing
Tighter Bounds for Facility Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A simple and deterministic competitive algorithm for online facility location
Information and Computation
Offline and online facility leasing
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Asymptotically optimal strategy-proof mechanisms for two-facility games
Proceedings of the 11th ACM conference on Electronic commerce
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
SIAM Journal on Computing
Winner-imposing strategyproof mechanisms for multiple facility location games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Memoryless facility location in one pass
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Cooperating to buy shoes in the real world: online cycle picking in directed graphs
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
| Hi-index | 0.00 |
In the online and incremental variants of Facility Location, the demands arrive one-by-one and must be assigned to an open facility upon arrival, without any knowledge about future demands. In the online variant, the decisions of opening a facility at a particular location and of assigning a demand to some facility are irrevocable. In the incremental variant, the algorithm can also merge existing facilities (and the corresponding demand clusters) with each other, and only the decision of assigning some demands to the same facility is irrevocable. The goal is to maintain, either online or incrementally, a set of facilities and an assignment of the demands to them that minimize the total facility opening cost plus the assignment cost for all demands. In this survey, we discuss the previous work on online and incremental algorithms for Facility Location. In addition to the main results, namely that the competitive ratio for the online variant is Θ(log nlog log n), where n is the number of demands, and that the competitive ratio for the incremental variant is O(1), we discuss all known online and incremental Facility Location algorithms, sketch the intuition behind them and the main ideas of their competitive analysis, and discuss some applications.