Advertisement

Algorithmica

, Volume 80, Issue 11, pp 3335–3364 | Cite as

Online Constrained Forest and Prize-Collecting Network Design

  • Jiawei Qian
  • Seeun William Umboh
  • David P. Williamson
Article
  • 119 Downloads

Abstract

In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berman and Coulston (Proceedings of the 29th annual ACM symposium on theory of computing, pp 344–353, 1997) and one for (offline) general network design problems due to Goemans and Williamson (SIAM J Comput 24:296–317, 1995); we give an \(O(\log k)\)-competitive algorithm, where k is the number of nodes that must be connected. We also consider a further generalization of the problem that allows us to pay penalties in exchange for violating connectivity constraints; we give an online \(O(\log k)\)-competitive algorithm for this case as well.

Keywords

Online algorithms Competitive ratio Generalized Steiner tree Prize-collecting Steiner tree 

References

  1. 1.
    Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24, 440–456 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized Steiner problem. Theor. Comput. Sci. 324, 313–324 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.): Network Models, Handbooks in Operations Research and Management Science, vol. 7. Elsevier, Amsterdam (1995)Google Scholar
  4. 4.
    Berman, P., Coulston, C.: On-line algorithms for Steiner tree problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 344–353 (1997)Google Scholar
  5. 5.
    Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.P.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Cheung, S.S.: Offline and online facility location and network design. Ph.D. thesis, Cornell University, School of Operations Research and Information Engineering (2016)Google Scholar
  7. 7.
    Goemans, M., Goldberg, A., Plotkin, S., Shmoys, D., Tardos, E., Williamson, D.: Improved approximation algorithms for network design problems. In: Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 223–232 (1994)Google Scholar
  8. 8.
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. In: Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 307–316 (1992)Google Scholar
  9. 9.
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 296–317 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Gu, A., Gupta, A., Kumar, A.: The power of deferral: maintaining a constant competitive Steiner tree online. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 525–534 (2013)Google Scholar
  11. 11.
    Gupta, A., Krishnaswamy, R., Ravi, R.: Online and stochastic survivable network design. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 685–694 (2009)Google Scholar
  12. 12.
    Hajiaghayi, M., Jain, K.: Prize-collecting generalized Steiner tree problem via a new approach of primal–dual schema. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 631–640 (2006)Google Scholar
  13. 13.
    Hajiaghayi, M., Liaghat, V., Panigrahi, D.: Online node-weighted Steiner forest and extensions via disk paintings. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, pp. 558–567 (2013)Google Scholar
  14. 14.
    Hajiaghayi, M., Liaghat, V., Panigrahi, D.: Near-optimal online algorithms for prize-collecting Steiner problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Lecture Notes in Computer Science, vol. 8572, pp. 576–587. Springer (2014)Google Scholar
  15. 15.
    Hayrapetyan, A., Swamy, C., Tardos, É.: Network design for information networks. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 933–942 (2005)Google Scholar
  16. 16.
    Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4, 369–384 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 760–769 (2000)Google Scholar
  18. 18.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  19. 19.
    Megow, N., Skutella, M., Verschae, J., Wiese, A.: The power of recourse for online MST and TSP. In: Czumaj, A., Mehlhorn, K., Pitts, A.M., Wattenhofer, R. (eds.) Automata, Languages, and Programming, no. 7391 in Lecture Notes in Computer Science, pp. 689–700. Springer (2012)Google Scholar
  20. 20.
    Qian, J., Williamson, D.P.: An \({O}(\log n)\)-competitive algorithm for online constrained forest problems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) Automata, Languages, and Programming, no. 6755 in Lecture Notes in Computer Science, pp. 37–48. Springer, Berlin (2011)Google Scholar
  21. 21.
    Sharma, Y., Swamy, C., Williamson, D.P.: Approximation algorithms for prize collecting forest problems with submodular penalty functions. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 1275–1284 (2007)Google Scholar
  22. 22.
    Umboh, S.: Online network design algorithms via hierarchical decompositions. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1373–1387 (2015)Google Scholar
  23. 23.
    Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal–dual approximation algorithm for generalized Steiner network problems. Combinatorica 15, 435–454 (1995)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.JW CapitalBeijingChina
  2. 2.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenNetherlands
  3. 3.School of Operations Research and Information EngineeringCornell UniversityIthacaUSA

Personalised recommendations