skip to main content
10.1145/3519270.3538473acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
extended-abstract

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model

Published: 21 July 2022 Publication History

Abstract

We present round complexity results in the CONGEST model for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these fundamental problems in both directed and undirected graphs, weighted and unweighted.

Supplementary Material

MP4 File (S7-T6-BA.mp4)
BA presentation video

References

[1]
Udit Agarwal and Vijaya Ramachandran. 2018. Fine-grained complexity for sparse graphs. In Proc. of the 50th Annual ACM SIGACT Symposium on Theory of Computing. 239--252.
[2]
Aaron Bernstein and Danupon Nanongkai. 2019. Distributed exact weighted allpairs shortest paths in near-linear time. In Proc. of the 51st Annual ACM SIGACT Symposium on Theory of Computing. 334--342.
[3]
Andrew Drucker, Fabian Kuhn, and Rotem Oshman. 2014. On the power of the congested clique model. In Proc. of the 2014 ACM symposium on Principles of distributed computing. 367--376.
[4]
Stephan Holzer and Roger Wattenhofer. 2012. Optimal Distributed All Pairs Shortest Paths and Applications. In Proc. of the 2012 ACM Symposium on Principles of Distributed Computing. 355--364.
[5]
Naoki Katoh, Toshihide Ibaraki, and Hisashi Mine. 1982. An efficient algorithm for k shortest simple paths. Networks 12, 4 (1982), 411--427.
[6]
Janne H. Korhonen and Joel Rybicki. 2017. Deterministic Subgraph Detection in Broadcast CONGEST. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017), Vol. 95. 4:1--4:16.
[7]
Christoph Lenzen, Boaz Patt-Shamir, and David Peleg. 2019. Distributed distance computation and routing with small messages. Distributed Computing 32, 2 (2019), 133--157.
[8]
Vignesh Manoharan and Vijaya Ramachandran. 2022. Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Models. (2022). https://doi.org/XXXX arXiv:arXiv:22XX.XXXXX [cs.DC]
[9]
David Peleg. 2000. Distributed computing: a locality-sensitive approach. SIAM.
[10]
David Peleg, Liam Roditty, and Elad Tal. 2012. Distributed Algorithms for Network Diameter and Girth. In Automata, Languages, and Programming. Springer Berlin Heidelberg, 660--672.
[11]
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2012. Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41, 5 (2012), 1235--1265.
[12]
Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. Management Science 17, 11 (1971), 712--716.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
July 2022
509 pages
ISBN:9781450392624
DOI:10.1145/3519270
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2022

Check for updates

Author Tags

  1. congest lower bounds
  2. distributed algorithms
  3. minimum weight cycle
  4. replacement paths

Qualifiers

  • Extended-abstract

Funding Sources

  • National Science Foundation

Conference

PODC '22
Sponsor:

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 56
    Total Downloads
  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)1
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media