Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Advances in Database Technology EDBT 2017 : 20th International Conference on Extending Database Technology ; Proceedings / Markl, Volker et al. (Hrsg.). - Konstanz : OpenProceedings.org, 2017. - S. 414-425. - eISSN 2367-2005. - ISBN 978-3-89318-073-8
In: 20th International Conference on Extending Database Technology : EDBT 2017, 21. Mär 2017 - 24. Mär 2017, Venice, Italy
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2017
- Creator
- URN
-
urn:nbn:de:bsz:352-2-1g7olmzoe6uji7
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
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
- Bibliothek der Universität Konstanz
Time of origin
- 2017
Other Objects (12)
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Alternative routing : k-shortest paths with limited overlap
Fast approximate shortest paths in the congested clique
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Reconfiguring Shortest Paths in Graphs
Timetable information and shortest paths
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Alternative routing : k-shortest paths with limited overlap
Fast approximate shortest paths in the congested clique
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Reconfiguring Shortest Paths in Graphs
Timetable information and shortest paths
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Alternative routing : k-shortest paths with limited overlap
Fast approximate shortest paths in the congested clique
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Most Diverse Near-Shortest Paths
Shortest Paths for Line Segments
Reconfiguring Shortest Paths in Graphs