Algorithms - ESA 2003
From MaRDI portal
Publication:5897292
DOI10.1007/b13632zbMath1266.68234OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897292
Dorothea Wagner, Thomas Willhalm
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Traffic problems in operations research (90B20) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps ⋮ Shortest-path queries in static networks ⋮ Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments ⋮ Engineering Route Planning Algorithms ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Uses Software
This page was built for publication: Algorithms - ESA 2003
