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, Pal, 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.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  A. Bley,et al.  Approximation algorithms for connected facility location with buyat-bulk edge costs , 2012 .

[3]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[4]  Mohammad Mahdian,et al.  Approximation Algorithms for Metric Facility Location Problems , 2006, SIAM J. Comput..

[5]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[6]  Shi Li,et al.  A 1.488 approximation algorithm for the uncapacitated facility location problem , 2011, Inf. Comput..

[7]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[8]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[9]  Dimitris Fotakis,et al.  Online and incremental algorithms for facility location , 2011, SIGA.

[10]  Jaroslaw Byrka,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

[11]  Klaus Jansen,et al.  Approximation Algorithms for Combinatorial Optimization , 2000 .

[12]  Chaitanya Swamy,et al.  Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.

[13]  Friedrich Eisenbrand,et al.  Connected facility location via random facility sampling and core detouring , 2010, J. Comput. Syst. Sci..

[14]  David P. Williamson,et al.  Offline and online facility leasing , 2013, Discret. Optim..

[15]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[16]  Kyung-Yong Chwa,et al.  A 6.55 factor primal-dual approximation algorithm for the connected facility location problem , 2009, J. Comb. Optim..

[17]  Dimitris Fotakis.  A Primal-Dual Algorithm for Online Non-uniform Facility Location , 2005, Panhellenic Conference on Informatics.

[18]  Aravind Srinivasan,et al.  Cost-Sharing Mechanisms for Network Design , 2004, APPROX-RANDOM.

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Adam Meyerson,et al.  Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[21]  Dimitris Fotakis,et al.  On the Competitive Ratio for Online Facility Location , 2003, Algorithmica.