The Online Multicommodity Connected Facility Location Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10787)


Grandoni and Rothvoß introduced the Multicommodity Connected Facility Location problem, a generalization of the Connected Facility Location problem which arises from a combination of the Facility Location and the Steiner Forest problems through the rent-or-buy model. We consider the online version of this problem and present a randomized algorithm that is \(\mathrm {O}(\log ^2 n)\)-competitive, where n is the number of given client pairs. Our algorithm combines the sample-and-augment framework of Gupta, Kumar, Pál, and Roughgarden with previous algorithms for the Online Prize-Collecting Facility Location and the Online Steiner Forest problems. Also, for the special case of the problem with edge scale factor equals 1, we show that a variant of our algorithm is deterministic and \(\mathrm {O}(\log n)\)-competitive. Finally, we speculate on the possibility of finding a \(\mathrm {O}(\log n)\)-competitive algorithm for the general case and the difficulties to achieve such ratio.


Online algorithms Competitive analysis Facility Location Steiner Forest Rent-or-buy problems Randomized algorithms 


  1. 1.
    Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized Steiner problem. Theor. Comput. Sci. 324(2–3), 313–324 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Berman, P., Coulston, C.: On-line algorithms for Steiner tree problems (extended abstract). In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 344–353 (1997)Google Scholar
  3. 3.
    Elmachtoub, A.N., Levi, R.: From cost sharing mechanisms to online selection problems. Math. Oper. Res. 40(3), 542–557 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    San Felice, M.C., Cheung, S., Lee, O., Williamson, D.P.: The online prize-collecting facility location problem. In: Proceedings of the VIII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 50 of Electronic Notes in Discrete Mathematics, pp. 151–156 (2015)Google Scholar
  5. 5.
    San Felice, M.C., Williamson, D.P., Lee, O.: A randomized O\((\log n)\)-competitive algorithm for the online connected facility location problem. Algorithmica 76(4), 1139–1157 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Fotakis, D.: A primal-dual algorithm for online non-uniform facility location. J. Discrete Algorithms 5(1), 141–148 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fotakis, D.: On the competitive ratio for online facility location. Algorithmica 50(1), 1–57 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fotakis, D.: Online and incremental algorithms for facility location. SIGACT News 42(1), 97–131 (2011)CrossRefGoogle Scholar
  9. 9.
    Grandoni, F., Rothvoß, T.: Approximation algorithms for single and multi-commodity connected facility location. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 248–260. Springer, Heidelberg (2011). Scholar
  10. 10.
    Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: simpler and better approximation algorithms for network design. J. ACM 54(3) (2007). Article 11Google Scholar
  11. 11.
    Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4(3), 369–384 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Khuller, S., Zhu, A.: The general Steiner tree-star problem. Inf. Process. Lett. 84(4), 215–220 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Meyerson, A.: Online facility location. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 426–431 (2001)Google Scholar
  14. 14.
    Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)CrossRefzbMATHGoogle Scholar
  15. 15.
    Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Discrete Optim. 10(4), 361–370 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Umboh, S.: Online network design algorithms via hierarchical decompositions. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1373–1387 (2015)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of ComputingFederal University of São CarlosSão CarlosBrazil
  2. 2.Department of Computer ScienceUniversity of São PauloSão PauloBrazil
  3. 3.Center for Mathematics, Computation and CognitionFederal University of ABCSanto AndréBrazil

Personalised recommendations