Home | deutsch  | Legals | Sitemap | KIT

Computing Many-to-Many Shortest Paths Using Highway Hierarchies

Computing Many-to-Many Shortest Paths Using Highway Hierarchies
Conference:

Workshop on Algorithm Engineering and Experiments (ALENEX 2007)

Year:2007
Date:January 2007 Page(s):36-45
Author(s):

S. Knopp, P. Sanders, D. Schultes, F. Schulz, D. Wagner

Links:Fulltext as PDF
Source:Proceedings of ALENEX 2007, SIAM