Skip to main content
SpringerLink
Log in

Tight Bounds for Online Weighted Tree Augmentation

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an n-vertex tree \(T = (V,E)\) and an additional set \(L \subseteq {V \atopwithdelims ()2}\) of edges (called links) with costs. Then, terminal pairs arrive one-by-one and our task is to maintain a low-cost subset of links F such that every terminal pair that has arrived so far is 2-edge-connected in \(T \cup F\). This online problem was first studied by Gupta, Krishnaswamy and Ravi (SICOMP 2012) who used it as a subroutine for the online survivable network design problem. They gave a deterministic \(O(\log ^2 n)\)-competitive algorithm and showed an \(\varOmega (\log n)\) lower bound on the competitive ratio of randomized algorithms. The case when T is a path is also interesting: it is exactly the online interval set cover problem, which also captures as a special case the parking permit problem studied by Meyerson (FOCS 2005). The contribution of this paper is to give tight results for online weighted tree and path augmentation problems. The main result of this work is a deterministic \(O(\log n)\)-competitive algorithm for online WTAP, which is tight up to constant factors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. In the online set cover problem, elements arrive online and need to be covered upon arrival by sets from a set system known in advance. (Note that not necessarily all elements will appear.)

  2. The interval set cover problem is a special case of the set cover problem where the elements are a set of points on the real line and the sets are intervals.

References

  1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)

    Article  MathSciNet  Google Scholar 

  2. Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized Steiner problem. Theor. Comput. Sci. 324, 313–324 (2004)

    Article  MathSciNet  Google Scholar 

  3. Bartal, Y., Fandina, N., Umboh, S.W.: Online probabilistic metric embedding: a general framework for bypassing inherent bounds. In: Chawla, S. (eds) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5–8 Jan 2020, pp. 1538–1557. SIAM (2020)

  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)

  5. Dehghani, S., Ehsani, S., Hajiaghayi, M.T., Liaghat, V., Seddighin, S.: Greedy algorithms for online survivable network design. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9–13 July 2018, Prague, Czech Republic, pp. 152:1–152:14 (2018)

  6. Even, G., Smorodinsky, S.: Hitting sets online and unique-max coloring. Discrete Appl. Math. 178, 71–82 (2014)

    Article  MathSciNet  Google Scholar 

  7. Frederickson, G.N., JáJá, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270–283 (1981)

    Article  MathSciNet  Google Scholar 

  8. Golumbic, M.C.: Algorithmic graph theory and perfect graphs (1980)

  9. Grandoni, F.., Kalaitzis, C., Zenklusen, R.: Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25–29, 2018, pp. 632–645 (2018)

  10. Gupta, A., Krishnaswamy, R., Ravi, R.: Online and stochastic survivable network design. SIAM J. Comput. 41(6), 1649–1672 (2012)

    Article  MathSciNet  Google Scholar 

  11. Hajiaghayi, M.T., 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)

  12. Hajiaghayi, M.T., 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, Berlin (2014)

    Google Scholar 

  13. Imase, M., Waxman, B.M.: Dynamic Steiner tree problem. SIAM J. Discrete Math. 4, 369–384 (1991)

    Article  MathSciNet  Google Scholar 

  14. Jordan, Camille: Sur les assemblages de lignes. J. Reine Angew. Math. 1869(70), 185–190 (1869)

    Article  MathSciNet  Google Scholar 

  15. Lee, J.: A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2004)

    Book  Google Scholar 

  16. Meyerson, A.: The parking permit problem. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 274–282 (2005)

  17. Naor, J., Panigrahi, D., Singh, M.: Online node-weighted Steiner tree and related problems. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22–25 Oct 2011, pp. 210–219 (2011)

  18. Naor, J.S., Umboh, S.W., Williamson, D.P.: Tight bounds for online weighted tree augmentation. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, 9–12 July 2019, Patras, Greece, LIPIcs, vol. 132, pp. 88:1–88:14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Wadern (2019)

  19. Qian, J., Umboh, S.W., Williamson, D.P.: Online constrained forest and prize-collecting network design. Algorithmica 80(11), 3335–3364 (2018)

    Article  MathSciNet  Google Scholar 

  20. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)

    Article  MathSciNet  Google Scholar 

  21. 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)

Download references

Author information

Authors and Affiliations

  1. Technion, Haifa, Israel

    Joseph (Seffi) Naor

  2. The University of Sydney, Sydney, Australia

    Seeun William Umboh

  3. Cornell University, Ithaca, USA

    David P. Williamson

Authors
  1. Joseph (Seffi) Naor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seeun William Umboh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David P. Williamson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seeun William Umboh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was done in part while all authors were visiting the Simons Institute for the Theory of Computing, and while SWU was at Eindhoven University of Technology, the Hebrew University of Jerusalem and the Technion. JN was supported in part by ISF grant 1585/15 and BSF Grant 2014414. SWU was supported in part by NWO Grant 639.022.211 and ISF Grant 1817/17. A preliminary version of this paper appeared in ICALP 2019 [18]. This version includes proofs omitted from the preliminary version.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Naor, J.(., Umboh, S.W. & Williamson, D.P. Tight Bounds for Online Weighted Tree Augmentation. Algorithmica 84, 304–324 (2022). https://doi.org/10.1007/s00453-021-00888-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-021-00888-7

Search

Navigation