- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: The VLDB journal, Band 29, Ausgabe 5, Seite 1023-1047, 2020
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2023
- Urheber
- DOI
-
10.1007/s00778-020-00604-x
- URN
-
urn:nbn:de:kobv:11-110-18452/27691-3
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 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 Benjamin
- Humboldt-Universität zu Berlin
Entstanden
- 2023
Ä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
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
Shortest edge disjoint paths in 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
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
Shortest edge disjoint paths in 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
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
K∗: A Directed On-The-Fly Algorithm for Finding the k Shortest Paths
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths