Streaming Algorithms for Connectivity Augmentation

Authors Ce Jin , Michael Kapralov, Sepideh Mahabadi , Ali Vakilian



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.93.pdf
  • Filesize: 0.94 MB
  • 20 pages

Document Identifiers

Author Details

Ce Jin
  • MIT, Cambridge, MA, USA
Michael Kapralov
  • EPFL, Lausanne, Switzerland
Sepideh Mahabadi
  • Microsoft Research-Redmond, WA, USA
Ali Vakilian
  • Toyota Technological Institute at Chicago (TTIC), IL, USA

Cite AsGet BibTex

Ce Jin, Michael Kapralov, Sepideh Mahabadi, and Ali Vakilian. Streaming Algorithms for Connectivity Augmentation. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 93:1-93:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.93

Abstract

We study the k-connectivity augmentation problem (k-CAP) in the single-pass streaming model. Given a (k-1)-edge connected graph G = (V,E) that is stored in memory, and a stream of weighted edges (also called links) L with weights in {0,1,… ,W}, the goal is to choose a minimum weight subset L' ⊆ L of the links such that G' = (V,E∪ L') is k-edge connected. We give a (2+ε)-approximation algorithm for this problem which requires to store O(ε^{-1} nlog n) words. Moreover, we show the tightness of our result: Any algorithm with better than 2-approximation for the problem requires Ω(n²) bits of space even when k = 2. This establishes a gap between the optimal approximation factor one can obtain in the streaming vs the offline setting for k-CAP. We further consider a natural generalization to the fully streaming model where both E and L arrive in the stream in an arbitrary order. We show that this problem has a space lower bound that matches the best possible size of a spanner of the same approximation ratio. Following this, we give improved results for spanners on weighted graphs: We show a streaming algorithm that finds a (2t-1+ε)-approximate weighted spanner of size at most O(ε^{-1} n^{1+1/t}log n) for integer t, whereas the best prior streaming algorithm for spanner on weighted graphs had size depending on log W. We believe that this result is of independent interest. Using our spanner result, we provide an optimal O(t)-approximation for k-CAP in the fully streaming model with O(nk + n^{1+1/t}) words of space. Finally we apply our results to network design problems such as Steiner tree augmentation problem (STAP), k-edge connected spanning subgraph (k-ECSS) and the general Survivable Network Design problem (SNDP). In particular, we show a single-pass O(tlog k)-approximation for SNDP using O(kn^{1+1/t}) words of space, where k is the maximum connectivity requirement.

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Graph algorithms analysis
Keywords
  • streaming algorithms
  • connectivity augmentation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen G. Kobourov, and Richard Spence. Graph spanners: A tutorial review. Comput. Sci. Rev., 37:100253, 2020. Google Scholar
  2. Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Symposium on Principles of Database Systems, pages 5-14, 2012. Google Scholar
  3. Sepehr Assadi and Aditi Dudeja. A simple semi-streaming algorithm for global minimum cuts. In Symposium on Simplicity in Algorithms (SOSA), pages 172-180. SIAM, 2021. Google Scholar
  4. Sepehr Assadi, Sanjeev Khanna, and Yang Li. On estimating maximum matching size in graph streams. In Proceedings of the Symposium on Discrete Algorithms, pages 1723-1742, 2017. Google Scholar
  5. Sepehr Assadi, Sanjeev Khanna, Yang Li, and Grigory Yaroslavtsev. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 1345-1364, 2016. Google Scholar
  6. Ashwinkumar Badanidiyuru, Baharan Mirzasoleiman, Amin Karbasi, and Andreas Krause. Streaming submodular maximization: Massive data summarization on the fly. In Proceedings of the international conference on Knowledge discovery and data mining, pages 671-680, 2014. Google Scholar
  7. Surender Baswana. Streaming algorithm for graph spanners-single pass and constant processing time per edge. Inf. Process. Lett., 106(3):110-114, 2008. Google Scholar
  8. Jarosław Byrka, Fabrizio Grandoni, and Afrouz Jabal Ameli. Breaching the 2-approximation barrier for connectivity augmentation: a reduction to steiner tree. In Symposium on Theory of Computing, pages 815-825, 2020. Google Scholar
  9. Federica Cecchetto, Vera Traub, and Rico Zenklusen. Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In Symposium on Theory of Computing, pages 370-383, 2021. Google Scholar
  10. Chandra Chekuri, Alina Ene, and Ali Vakilian. Prize-collecting survivable network design in node-weighted graphs. In International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 98-109, 2012. Google Scholar
  11. Chandra Chekuri, Alina Ene, and Ali Vakilian. Node-weighted network design in planar and minor-closed families of graphs. ACM Transactions on Algorithms (TALG), 17(2):1-25, 2021. Google Scholar
  12. Joseph Cheriyan and László A Végh. Approximating minimum-cost k-node connected subgraphs via independence-free graphs. SIAM Journal on Computing, 43(4):1342-1362, 2014. Google Scholar
  13. Michael S. Crouch, Andrew McGregor, and Daniel M. Stubbs. Dynamic graphs in the sliding-window model. In Algorithms - ESA 2013 - 21st Annual European Symposium, volume 8125 of Lecture Notes in Computer Science, pages 337-348. Springer, 2013. Google Scholar
  14. E A Dinits, Alexander V Karzanov, and Micael V Lomonosov. On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, pages 290-306, 1973. Google Scholar
  15. Michael Elkin. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. ACM Trans. Algorithms, 7(2):20:1-20:17, 2011. Google Scholar
  16. Guy Even, Jon Feldman, Guy Kortsarz, and Zeev Nutov. A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Transactions on Algorithms (TALG), 5(2):1-17, 2009. Google Scholar
  17. Jittat Fakcharoenphol and Bundit Laekhanukit. An O(log² k)-approximation algorithm for the k-vertex connected spanning subgraph problem. In Proceedings of the Symposium on Theory of Computing, pages 153-158, 2008. Google Scholar
  18. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. On graph problems in a semi-streaming model. In International Colloquium on Automata, Languages, and Programming, pages 531-543, 2004. Google Scholar
  19. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. Graph distances in the data-stream model. Journal on Computing, 38(5):1709-1727, 2008. Google Scholar
  20. Manuel Fernández V, David P Woodruff, and Taisuke Yasuda. Graph spanners in the message-passing model. In Innovations in Theoretical Computer Science Conference, 2020. Google Scholar
  21. Arnold Filtser, Michael Kapralov, and Navid Nouri. Graph spanners by sketching in dynamic streams and the simultaneous communication model. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 1894-1913, 2021. Google Scholar
  22. Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci., 50(2):259-273, 1995. Google Scholar
  23. Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Krzysztof Sornat. On the cycle augmentation problem: hardness and approximation algorithms. Theory of Computing Systems, 65:985-1008, 2021. Google Scholar
  24. Mohit Garg, Fabrizio Grandoni, and Afrouz Jabal Ameli. Improved approximation for two-edge-connectivity. In Symposium on Discrete Algorithms (SODA), pages 2368-2410, 2023. Google Scholar
  25. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. On the communication and streaming complexity of maximum bipartite matching. In Symposium on Discrete Algorithms (SODA), pages 468-485, 2012. Google Scholar
  26. MX Goemans, AV Goldberg, S Plotkin, DB Shmoys, É Tardos, and DP Williamson. Improved approximation algorithms for network design problems. In Symposium on Discrete Algorithms (SODA), pages 223-232, 1994. Google Scholar
  27. Fabrizio Grandoni, Christos Kalaitzis, and Rico Zenklusen. Improved approximation for tree augmentation: saving by rewiring. In Symposium on Theory of Computing, pages 632-645, 2018. Google Scholar
  28. Venkatesan Guruswami and Krzysztof Onak. Superlinear lower bounds for multipass graph processing. Algorithmica, 76:654-683, 2016. Google Scholar
  29. K. Jain. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21(1):39-60, 2001. Google Scholar
  30. Michael Kapralov. Space lower bounds for approximating maximum matching in the edge arrival model. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1874-1893, 2021. Google Scholar
  31. Michael Kapralov, Yin Tat Lee, Cameron Musco, Christopher Musco, and Aaron Sidford. Single pass spectral sparsification in dynamic streams. SIAM J. Comput., 46(1):456-477, 2017. Google Scholar
  32. Michael Kapralov, Aida Mousavifar, Cameron Musco, Christopher Musco, Navid Nouri, Aaron Sidford, and Jakab Tardos. Fast and space efficient spectral sparsification in dynamic streams. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 1814-1833, 2020. Google Scholar
  33. Michael Kapralov and David Woodruff. Spanners and sparsifiers in dynamic streams. In Proceedings of the Symposium on Principles of Distributed Computing, pages 272-281, 2014. Google Scholar
  34. David R. Karger and Debmalya Panigrahi. A near-linear time algorithm for constructing a cactus representation of minimum cuts. In Claire Mathieu, editor, Proceedings of the Symposium on Discrete Algorithms (SODA), pages 246-255, 2009. Google Scholar
  35. Samir Khuller and Ramakrishna Thurimella. Approximation algorithms for graph augmentation. Journal of Algorithms, 14(2):214-225, 1993. Google Scholar
  36. Samir Khuller and Uzi Vishkin. Biconnectivity approximations and graph carvings. J. ACM, 41(2):214-235, 1994. Google Scholar
  37. Guy Kortsarz and Zeev Nutov. Approximating k-node connected subgraphs via critical graphs. SIAM Journal on Computing, 35(1):247-257, 2005. Google Scholar
  38. Guy Kortsarz and Zeev Nutov. A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Transactions on Algorithms, 12(2):1-20, 2015. Google Scholar
  39. Andrew McGregor. Finding graph matchings in data streams. In International Workshop on Approximation Algorithms for Combinatorial Optimization, pages 170-181. Springer, 2005. Google Scholar
  40. Hiroshi Nagamochi. An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics, 126(1):83-113, 2003. Google Scholar
  41. Hiroshi Nagamochi and Toshihide Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7(5&6):583-596, 1992. Google Scholar
  42. Jelani Nelson and Huacheng Yu. Optimal lower bounds for distributed and streaming spanning forest computation. In Proceedings of the Symposium on Discrete Algorithms, pages 1844-1860, 2019. Google Scholar
  43. Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, and Ola Svensson. Beyond 1/2-approximation for submodular maximization on massive data streams. In International Conference on Machine Learning, pages 3829-3838, 2018. Google Scholar
  44. Zeev Nutov. Approximating steiner networks with node-weights. SIAM Journal on Computing, 39(7):3001-3022, 2010. Google Scholar
  45. R Ravi, Weizhong Zhang, and Michael Zlatin. Approximation algorithms for steiner tree augmentation problems. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2429-2448, 2023. Google Scholar
  46. Aviad Rubinstein, Tselil Schramm, and S. Matthew Weinberg. Computing exact minimum cuts without knowing the graph. In 9th Innovations in Theoretical Computer Science Conference, ITCS, volume 94 of LIPIcs, pages 39:1-39:16, 2018. Google Scholar
  47. Xiaoming Sun and David P Woodruff. Tight bounds for graph problems in insertion streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. Google Scholar
  48. Vera Traub and Rico Zenklusen. A better-than-2 approximation for weighted tree augmentation. In Foundations of Computer Science (FOCS), pages 1-12, 2022. Google Scholar
  49. Vera Traub and Rico Zenklusen. Local search for weighted tree augmentation and steiner tree. In Symposium on Discrete Algorithms (SODA), pages 3253-3272, 2022. Google Scholar
  50. Vera Traub and Rico Zenklusen. A (1.5+ε)-approximation algorithm for weighted connectivity augmentation. In Symposium on Theory of Computing, pages 1820-1833, 2023. Google Scholar
  51. David P Williamson, Michel X Goemans, Milena Mihail, and Vijay V Vazirani. A primal-dual approximation algorithm for generalized steiner network problems. In Proceedings of the Symposium on Theory of Computing (STOC), pages 708-717, 1993. Google Scholar
  52. Mariano Zelke. k-connectivity in the semi-streaming model. arXiv preprint cs/0608066, 2006. URL: https://arxiv.org/abs/cs/0608066.
  53. Mariano Zelke. Intractability of min-and max-cut in streaming graphs. Information Processing Letters, 111(3):145-150, 2011. Google Scholar