The Online Connected Facility Location Problem
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online version of the Connected Facility Location problem (CFL). The CFL is a combination of the Uncapacitated Facility Location problem (FL) and the Steiner Tree problem (ST). We give a randomized O(log2 n)-competitive algorithm for the OCFL via the sample-and-augment framework of Gupta, Kumar, Pál, and Roughgarden and previous algorithms for Online Facility Location (OFL) and Online Steiner Tree (OST). Also, we show that the same algorithm is a deterministic O(logn)-competitive algorithm for the special case of the OCFL with M = 1, where M is a scale factor for the edge costs.
KeywordsOnline Algorithms Competitive Analysis Connected Facility Location Steiner Tree Approximation Algorithms Randomized Algorithms
Unable to display preview. Download preview PDF.
- 5.Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Press Syndicate of the University of Cambridge (1998)Google Scholar
- 6.Meyerson, A.: Online facility location. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 426–431 (2001)Google Scholar
- 11.Vazirani, V.: Approximation Algorithms. Springer (2003)Google Scholar
- 12.Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)Google Scholar
- 15.Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: Simpler and better approximation algorithms for network design. Journal of the ACM 54(3), Article 11 (2007)Google Scholar