Near Optimal Algorithms For The Single Source Replacement Paths Problem

DOI10.1137/1.9781611975482.126zbMath1432.68562OpenAlexW4254874273MaRDI QIDQ5236312

Sarel Cohen, Shiri Chechik

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.126

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (1)

Incremental distance products via faulty shortest paths

This page was built for publication: Near Optimal Algorithms For The Single Source Replacement Paths Problem