- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: SIGSPATIAL '21 : Proceedings of the 29th International Conference on Advances in Geographic Information Systems / Meng, Xiaofeng; Wang, Fusheng; Lu, Chang-Tien et al. (Hrsg.). - New York, NY : ACM, 2021. - S. 229-239. - ISBN 978-1-4503-8664-7
In: SIGSPATIAL '21 : 29th International Conference on Advances in Geographic Information Systems, 2. Nov. 2021 - 5. Nov. 2021, Beijing, China
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
KOPS Universität Konstanz
- (wann)
-
2021
- Urheber
-
Häcker, Christian
Bouros, Panagiotis
Chondrogiannis, Theodoros
Althaus, Ernst
- URN
-
urn:nbn:de:bsz:352-2-xz0em7x5o00r1
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:51 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
- Häcker, Christian
- Bouros, Panagiotis
- Chondrogiannis, Theodoros
- Althaus, Ernst
- KOPS Universität Konstanz
Entstanden
- 2021
Ähnliche Objekte (12)
Shortest Paths II
Universal Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest edge disjoint paths in graphs
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Constrained shortest paths and related problems
Unobstructed shortest paths in polyhedral environments
Constrained shortest paths and related problems
Average-case complexity of shortest-paths problems
Shortest Paths II
Universal Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest edge disjoint paths in graphs
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Constrained shortest paths and related problems
Unobstructed shortest paths in polyhedral environments
Constrained shortest paths and related problems
Average-case complexity of shortest-paths problems
Shortest Paths II
Universal Shortest Paths
Shortest Paths for Line Segments
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest edge disjoint paths in graphs
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Constrained shortest paths and related problems
Unobstructed shortest paths in polyhedral environments
Constrained shortest paths and related problems