- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: The VLDB Journal ; 29 (2020), 5. - S. 1023-1047. - Springer. - ISSN 1066-8888. - eISSN 0949-877X
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
KOPS Universität Konstanz
- (when)
-
2020
- Creator
- URN
-
urn:nbn:de:bsz:352-2-76tlg703mdvs7
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:47 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Chondrogiannis, Theodoros
- Bouros, Panagiotis
- Gamper, Johann
- Leser, Ulf
- Blumenthal, David B.
- KOPS Universität Konstanz
Time of origin
- 2020
Other Objects (12)
Finding k-shortest paths with limited overlap
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Alternative routing : k-shortest paths with limited overlap
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
Drawing Shortest Paths in Geodetic Graphs
Finding k-shortest paths with limited overlap
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Alternative routing : k-shortest paths with limited overlap
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
Drawing Shortest Paths in Geodetic Graphs
Finding k-shortest paths with limited overlap
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Alternative routing : k-shortest paths with limited overlap
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths