Home | english  | Impressum | Sitemap | KIT

Computing Many-to-Many Shortest Paths Using Highway Hierarchies

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

Workshop on Algorithm Engineering and Experiments (ALENEX 2007)

Jahr:2007
Datum:January 2007 Seite:36-45
Autoren:

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

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