Approximation algorithms for facility location problems (extended abstract)
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
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth 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
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation algorithms for facility location problems
Approximation algorithms for facility location problems
A simple and deterministic competitive algorithm for online facility location
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Offline and online facility leasing
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A game-theoretic approach to non-cooperative target assignment
Robotics and Autonomous Systems
Online clustering with variable sized clusters
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Online and incremental algorithms for facility location
ACM SIGACT News
An algorithm for online facility leasing
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
In the online version of Facility Location, the demand points arrive one at a time and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We present a simple deterministic primal-dual algorithm for the general case of non-uniform facility costs. We prove that its competitive ratio is no greater than 4log(n+1)+2, which is close to the lower bound of @W(lognloglogn).