Speeding up dynamic shortest-path algorithms

DOI10.1287/IJOC.1070.0231MaRDI QIDQ2901004zbMATH OpenOpenAlexFDO

Authors Luciana Buriol, Mikkel Thorup, 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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• Faster algorithms for the shortest path problem
• On-line and dynamic algorithms for shortest path problems
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 30302
• Algorithms – ESA 2004

Cited in

(23)

• Maintaining dynamic minimum spanning trees: an experimental study
• On the minimization of traffic congestion in road networks with tolls
• A biased random-key genetic algorithm for road congestion minimization
• Dynamically maintaining shortest path trees under batches of updates
• scientific article; zbMATH DE number 1983277 (Why is no real title available?)
• Applications of meta-heuristics to traffic engineering in IP networks
• Arc-flags in dynamic graphs
• Intra-domain traffic engineering with shortest path routing protocols
• Algorithms – ESA 2004
• Optimization of OSPF routing in IP networks
• Fast paths in large-scale dynamic road networks
• Sparse weight tolerant subgraph for single source shortest path
• Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
• An auction-based approach for the re-optimization shortest path tree problem
• Experimental and Efficient Algorithms
• Approximating dynamic weighted vertex cover with soft capacities
• scientific article; zbMATH DE number 434492 (Why is no real title available?)
• An improved Dijkstra's shortest path algorithm for sparse network
• Bidirectional \(A^*\) search on time-dependent road networks
• Intra-domain traffic engineering with shortest path routing protocols
• Shortest paths on dynamic graphs
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• Faster algorithms for the shortest path problem

This page was built for publication: Speeding up dynamic shortest-path algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901004)