On-line and dynamic algorithms for shortest path problems

DOI10.1007/3-540-59042-0_73MaRDI QIDQ4596621zbMATH OpenOpenAlexFDO

Authors Hristo N. Djidjev, Grammati Pantziou, Christos Zaroliagis

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_73

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Online algorithms; streaming algorithms (68W27)

Recommendations

• Improved algorithms for dynamic shortest paths
• Dynamic algorithms for shortest paths in planar graphs
• scientific article; zbMATH DE number 176745
• scientific article; zbMATH DE number 219245
• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs

Cited in

(26)

• A special case the of dynamization problem for least cost paths
• On-line computation of minimal and maximal length paths
• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
• Improved algorithms for dynamic shortest paths
• On-line algorithms for the dynamic traveling repair problem
• Dynamic shortest paths containers
• Algorithmic techniques for maintaining shortest routes in dynamic networks
• Speeding up dynamic shortest-path algorithms
• Arc-flags in dynamic graphs
• Dynamic shortest path algorithm based on variable weight
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 3907787 (Why is no real title available?)
• scientific article; zbMATH DE number 30302 (Why is no real title available?)
• Transmissions in a network with capacities and delays
• Parallel Algorithms for Dynamic Shortest Path Problems
• Shortest path queries in digraphs of small treewidth
• scientific article; zbMATH DE number 219245 (Why is no real title available?)
• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
• On the computation of fast data transmissions in networks with capacities and delays
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Shortest-path algorithms and dynamic cost changes
• Algorithms – ESA 2004
• Optimal parallel shortest paths in small treewidth digraphs
• Dynamic algorithms for shortest paths in planar graphs
• Algorithms -- ESA '93. 1st annual European symposium Bad Honnef, Germany, September 30 -- October 2, 1993. Proceedings

This page was built for publication: On-line and dynamic algorithms for shortest path problems

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