TU Darmstadt / ULB / TUbiblio

Pareto Shortest Paths is Often Feasible in Practice

Müller-Hannemann, Matthias and Weihe, Karsten (2001):
Pareto Shortest Paths is Often Feasible in Practice.
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001), Springer, Arhus, Denmark, In: Lecture Notes in Computer Science, 2141, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2001
Creators: Müller-Hannemann, Matthias and Weihe, Karsten
Title: Pareto Shortest Paths is Often Feasible in Practice
Language: German
Title of Book: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001)
Series Name: Lecture Notes in Computer Science
Volume: 2141
Publisher: Springer
Divisions: 20 Department of Computer Science
Event Location: Arhus, Denmark
Date Deposited: 13 Mar 2016 20:50
Identification Number: MuellerhWeihe01
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item