- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems. - New York, NY : ACM Press, 2015. - 68. - ISBN 978-1-4503-3967-4
In: 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 3. Nov 2015 - 6. Nov 2015, Seattle, Washington
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2015
- Creator
- URN
-
urn:nbn:de:bsz:352-2-1c1tkagu2twpj6
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:48 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
- 2015
Other Objects (12)
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Finding k-shortest paths with limited overlap
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Shortest paths and Steiner trees in VLSI routing
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
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Shortest paths and Steiner trees in VLSI routing
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
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Shortest paths and Steiner trees in VLSI routing
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