Deterministic decremental single source shortest paths: beyond the o(mn) bound
From MaRDI portal
Publication:5361846
DOI10.1145/2897518.2897521zbMath1376.68060OpenAlexW2418286382MaRDI QIDQ5361846
Shiri Chechik, Aaron Bernstein
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2897518.2897521
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Distance-Preserving Graph Contractions ⋮ Distance-Preserving Graph Contractions
This page was built for publication: Deterministic decremental single source shortest paths: beyond the o(mn) bound
