- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: The VLDB Journal ; 29 (2020), 5. - S. 1023-1047. - Springer. - ISSN 1066-8888. - eISSN 0949-877X
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
KOPS Universität Konstanz
- (wann)
-
2020
- Urheber
- URN
-
urn:nbn:de:bsz:352-2-76tlg703mdvs7
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:47 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Chondrogiannis, Theodoros
- Bouros, Panagiotis
- Gamper, Johann
- Leser, Ulf
- Blumenthal, David B.
- KOPS Universität Konstanz
Entstanden
- 2020
Ähnliche Objekte (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