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)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sampling-based Approximation Algorithms for Multi-stage Stochastic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A primal-dual algorithm for online non-uniform facility location
Journal of Discrete Algorithms
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 |
We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain and Vazirani [5]. We also consider the online version of the facility leasing problem, in which the clients to be served arrive over time and are not known in advance. This problem generalizes both the online facility location problem (introduced by Meyerson [6]) and the parking permit problem (also introduced by Meyerson [7]). We give a deterministic algorithm for the problem that is O(K log n)-competitive. To achieve our result, we modify an O(log n)-competitive algorithm of Fotakis [2] for the online facility location problem.