Shortest-Path Algorithms and Dynamic Cost Changes

DOI10.1007/978-3-540-77903-2_17zbMath1209.90068OpenAlexW1595516480MaRDI QIDQ5391888

Klaus Ambrosi, Felix Hahne, Sven Baselau

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_17

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Bounded incremental computation
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

This page was built for publication: Shortest-Path Algorithms and Dynamic Cost Changes