Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler

DOI10.1137/1.9781611975994.154OpenAlexW2998265589MaRDI QIDQ5146945

Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Publication date: 2 February 2021

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

Full work available at URL: https://arxiv.org/abs/2001.10809

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs

This page was built for publication: Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler