Skip to main content
Springer Nature Link
Log in

Computing Replacement Paths in the CONGEST Model

  • Conference paper
  • First Online:
Structural Information and Communication Complexity (SIROCCO 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14662))

  • 245 Accesses

Abstract

We present several results on the round complexity of Replacement Paths and Second Simple Shortest Path which are basic graph problems that can address fault tolerance in distributed networks. These are well-studied in the sequential setting, and have algorithms [18, 20, 30, 34] that nearly match their fine-grained complexity [3, 33]. But very little is known about either problem in the distributed setting.

We present algorithms and lower bounds for these problems in the CONGEST model, with many of our results being close to optimal.

This work was supported in part by NSF grant CCF-2008241.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We use the notation \(\tilde{O}, \tilde{\varOmega }, \tilde{\varTheta }\) to hide poly-logarithmic factors.

References

  1. Abboud, A., Censor-Hillel, K., Khoury, S.: Near-linear lower bounds for distributed distance computations, even in sparse networks. In: Gavoille, C., Ilcinkas, D. (eds.) Proceedings of DISC 2016, pp. 29–42. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53426-7_3

  2. Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, apsp and diameter. In: Proceedings of SODA 2015, pp. 1681–1697. SIAM (2015)

    Google Scholar 

  3. Agarwal, U., Ramachandran, V.: Fine-grained complexity for sparse graphs. In: Proceedings of STOC 2018, pp. 239–252 (2018)

    Google Scholar 

  4. Agarwal, U., Ramachandran, V.: Faster deterministic all pairs shortest paths in congest model. In: SPAA 2020, pp. 11–21. ACM (2020)

    Google Scholar 

  5. Ancona, B., Censor-Hillel, K., Dalirrooyfard, M., Efron, Y., Williams, V.V.: Distributed distance approximation. In: OPODIS 2020, vol. 184, pp. 30:1–30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)

    Google Scholar 

  6. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702–732 (2004)

    Article  MathSciNet  Google Scholar 

  7. Bernstein, A., Nanongkai, D.: Distributed exact weighted all-pairs shortest paths in near-linear time. In: Proceedings of STOC 2019, pp. 334–342. ACM (2019)

    Google Scholar 

  8. Bodwin, G., Parter, M.: Restorable shortest path tiebreaking for edge-faulty graphs. J. ACM 70(5), 1–24 (2023)

    Article  MathSciNet  Google Scholar 

  9. Cao, N., Fineman, J.T.: Parallel exact shortest paths in almost linear work and square root depth. In: Proceedings of SODA 2023, pp. 4354–4372. SIAM (2023)

    Google Scholar 

  10. Chechik, S., Cohen, S.: Near optimal algorithms for the single source replacement paths problem. In: Proceedings of SODA 2019, pp. 2090–2109. SIAM (2019)

    Google Scholar 

  11. Chechik, S., Magen, O.: Near optimal algorithm for the directed single source replacement paths problem. In: ICALP 2020, vol. 168, pp. 81:1–81:17 (2020)

    Google Scholar 

  12. Chechik, S., Mukhtar, D.: Single-source shortest paths in the CONGEST model with improved bounds. Distrib. Comput. 35(4), 357–374 (2022)

    Article  MathSciNet  Google Scholar 

  13. Dinitz, M., Robelle, C.: Efficient and simple algorithms for fault-tolerant spanners. In: PODC 2020, pp. 493–500. ACM (2020)

    Google Scholar 

  14. Elkin, M.: An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem. SIAM J. Comput. 36(2), 433–456 (2006)

    Article  MathSciNet  Google Scholar 

  15. Ghaffari, M., Parter, M.: Near-optimal distributed algorithms for fault-tolerant tree structures. In: Proceedings of SPAA 2016, pp. 387–396. ACM (2016)

    Google Scholar 

  16. Ghaffari, M., Udwani, R.: Brief announcement: distributed single-source reachability. In: Proceedings of PODC 2015, pp. 163–165. ACM (2015)

    Google Scholar 

  17. Hoang, L., et al.: A round-efficient distributed betweenness centrality algorithm. In: Proceedings of PPoPP 2019, pp. 272–286. ACM (2019)

    Google Scholar 

  18. Katoh, N., Ibaraki, T., Mine, H.: An efficient algorithm for k shortest simple paths. Networks 12(4), 411–427 (1982)

    Article  MathSciNet  Google Scholar 

  19. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1996)

    Book  Google Scholar 

  20. Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manag. Sci. 18(7), 401–405 (1972)

    Article  MathSciNet  Google Scholar 

  21. Lenzen, C., Patt-Shamir, B., Peleg, D.: Distributed distance computation and routing with small messages. Distrib. Comput. 32(2), 133–157 (2019)

    Article  MathSciNet  Google Scholar 

  22. Manoharan, V., Ramachandran, V.: Near optimal bounds for replacement paths and related problems in the congest model. arXiv preprint arXiv:2205.14797 (2022)

  23. Manoharan, V., Ramachandran, V.: Improved approximation bounds for minimum weight cycle in the congest model. In: Proceedings of PODC 2024, ACM (2024, to appear)

    Google Scholar 

  24. Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proceedings of STOC 2014, pp. 565–573. ACM (2014)

    Google Scholar 

  25. Parter, M.: Distributed constructions of dual-failure fault-tolerant distance preservers. In: DISC 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020)

    Google Scholar 

  26. Parter, M.: Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. In: Proceedings of STOC 2022, pp. 1080–1092. ACM (2022)

    Google Scholar 

  27. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)

    Google Scholar 

  28. Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput. 30(5), 1427–1442 (2000)

    Article  MathSciNet  Google Scholar 

  29. Razborov, A.A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385–390 (1992)

    Article  MathSciNet  Google Scholar 

  30. Roditty, L., Zwick, U.: Replacement paths and k simple shortest paths in unweighted directed graphs. ACM Trans. Algor. (TALG) 8(4), 1–11 (2012)

    Article  MathSciNet  Google Scholar 

  31. Rozhoň, V., Haeupler, B., Martinsson, A., Grunau, C., Zuzic, G.: Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances. In: Proceedings of STOC 2023, pp. 321-334. ACM (2023)

    Google Scholar 

  32. Sarma, A.D., et al.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235–1265 (2012)

    Article  MathSciNet  Google Scholar 

  33. Williams, V.V., Williams, R.R.: Subcubic equivalences between path, matrix, and triangle problems. J. ACM 65(5), 27:1–27:38 (2018)

    Google Scholar 

  34. Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Texas at Austin, Austin, TX, USA

    Vignesh Manoharan & Vijaya Ramachandran

Authors
  1. Vignesh Manoharan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijaya Ramachandran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vignesh Manoharan .

Editor information

Editors and Affiliations

  1. Faculty of Data and Decision Sciences, Technion – Israel Institute of Technolog, Haifa, Israel

    Yuval Emek

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Manoharan, V., Ramachandran, V. (2024). Computing Replacement Paths in the CONGEST Model. In: Emek, Y. (eds) Structural Information and Communication Complexity. SIROCCO 2024. Lecture Notes in Computer Science, vol 14662. Springer, Cham. https://doi.org/10.1007/978-3-031-60603-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-60603-8_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-60602-1

  • Online ISBN: 978-3-031-60603-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation