Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
Pages 369 - 371
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
BA presentation video
- Download
- 272.85 MB
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.
Index Terms
- Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
Recommendations
Improved algorithms for the k simple shortest paths and the replacement paths problems
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
In this paper, we study the following replacement paths problem for undirected graphs in case of edge or node failures.1.In the edge failure problem, for each edge e on a shortest s-t path in G, we are required to find a shortest s-t path in G-e. 2.In ...
Faster Replacement Paths and Distance Sensitivity Oracles
Special Issue on Soda'18 and Regular PapersShortest paths computation is one of the most fundamental problems in computer science. An important variant of the problem is when edges can fail, and one needs to compute shortest paths that avoid a (failing) edge. More formally, given a source node s,...
Comments
Information & Contributors
Information
Published In
July 2022
509 pages
Copyright © 2022 Owner/Author.
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
Qualifiers
- Extended-abstract
Funding Sources
- National Science Foundation
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 56Total 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
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in