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

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

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)

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

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)