Engineering Time-Dependent Many-to-Many Shortest Paths Computation
From MaRDI portal
Publication:2917289
DOI10.4230/OASIcs.ATMOS.2010.74zbMath1247.90047OpenAlexW2163978269MaRDI QIDQ2917289
Peter Sanders, Robert Geisberger
Publication date: 28 September 2012
Full work available at URL: http://algo2.iti.kit.edu/download/time_dependent_many_to_many.pdf
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (1)
This page was built for publication: Engineering Time-Dependent Many-to-Many Shortest Paths Computation