Speeding Up Dynamic Shortest-Path Algorithms

DOI10.1287/ijoc.1070.0231zbMath1243.90221OpenAlexW2063896698MaRDI QIDQ2901004

Mikkel Thorup, Luciana S. Buriol, Mauricio G. C. Resende

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1070.0231

zbMATH Keywords

shortest-path algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (16)

Bidirectional A* search on time-dependent road networks ⋮ Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ A biased random-key genetic algorithm for road congestion minimization ⋮ On the minimization of traffic congestion in road networks with tolls ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Maintaining dynamic minimum spanning trees: an experimental study ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Fast paths in large-scale dynamic road networks ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Applications of meta-heuristics to traffic engineering in IP networks ⋮ Shortest paths on dynamic graphs ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Optimization of OSPF Routing in IP Networks ⋮ Approximating dynamic weighted vertex cover with soft capacities ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Dynamically Maintaining Shortest Path Trees under Batches of Updates

This page was built for publication: Speeding Up Dynamic Shortest-Path Algorithms