Hochschulschrift
Shortest path speed up techniques : lower bounds and applications
- Alternative title
-
Kürzeste Wege Speed Up Techniken
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Stuttgart, Universität Stuttgart, Diss., 2013
- Classification
-
Informatik
- Keyword
-
Algorithmus ; Navigation ; Ortung ; Optimierung ; Straßenkarte ; Implementation
- Event
-
Veröffentlichung
- (where)
-
Stuttgart
- (who)
-
Universitätsbibliothek der Universität Stuttgart
- (when)
-
2014
- Creator
- Contributor
-
Funke, Stefan
- URN
-
urn:nbn:de:bsz:93-opus-89472
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
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.
Object type
- Hochschulschrift
Associated
- Eisner, Jochen
- Funke, Stefan
- Universitätsbibliothek der Universität Stuttgart
Time of origin
- 2014
Other Objects (12)
Hierarchical speed-up techniques for shortest-path algorithms
Bisimulation on Speed: Lower Time Bounds
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Hierarchical speed-up techniques for shortest-path algorithms
Bisimulation on Speed: Lower Time Bounds
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Hierarchical speed-up techniques for shortest-path algorithms
Bisimulation on Speed: Lower Time Bounds
Distributed shortest-path computation
Shortest path network problems
New Multiobjective Shortest Path Algorithms
Variants of the Shortest Path Problem
Shortest path embeddings of graphs on surfaces
Engineering planar-separator and shortest-path algorithms
On Non-Classical Stochastic Shortest Path Problems
The Shapley value for shortest path games
Robot Navigation Beyond Planning the Shortest Path