An Algorithm for Facility Leasing

F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72.

Download
Restricted 636-Online_Facility_Location.pdf 173.05 KB
Conference Paper
Author
; ;
Abstract
We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.
Publishing Year
Proceedings Title
Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)
Page
61-72
LibreCat-ID

Cite this

Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO). LNCS. ; 2012:61-72. doi:10.1007/978-3-642-31104-8_6
Meyer auf der Heide, F., Pietrzyk, P., & Kling, P. (2012). An Algorithm for Facility Leasing. In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO) (pp. 61–72). https://doi.org/10.1007/978-3-642-31104-8_6
@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={10.1007/978-3-642-31104-8_6}, booktitle={Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }
Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 61–72. LNCS, 2012. https://doi.org/10.1007/978-3-642-31104-8_6.
F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72.
Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), 2012, pp. 61–72, doi:10.1007/978-3-642-31104-8_6.
Main File(s)
File Name
636-Online_Facility_Location.pdf 173.05 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-14T14:14:21Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar