Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
Abstract
Supplementary Material
- Download
- 272.85 MB
References
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

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Funding Sources
- National Science Foundation
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 56Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
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