Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Offline and Online Facility Leasing
verfasst von : Chandrashekhar Nagarajan, David P. Williamson
Erschienen in: Integer Programming and Combinatorial Optimization
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.