- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Acceleration of Shortest Path and Constrained Shortest Path Computation ; 2004, 42
Preprint Reihe Mathematik ; 2004, 42
- Classification
-
Mathematik
- Creator
-
Köhler, Ekkehard
Möhring, Rolf H.
Schilling, Heiko
- DOI
-
10.14279/depositonce-14287
- Handle
-
11303/15514
- URN
-
urn:nbn:de:101:1-2022011306594572633389
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 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
- Köhler, Ekkehard
- Möhring, Rolf H.
- Schilling, Heiko
Other Objects (12)
Distributed shortest-path computation
Shortest path network problems
Shortest path with acceleration constraints: complexity and approximation algorithms
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
Distributed shortest-path computation
Shortest path network problems
Shortest path with acceleration constraints: complexity and approximation algorithms
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms
Robot Navigation Beyond Planning the Shortest Path
Distributed shortest-path computation
Shortest path network problems
Shortest path with acceleration constraints: complexity and approximation algorithms
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation
Shortest path embeddings of graphs on surfaces
The Shapley value for shortest path games
Shortest path counting in probabilistic biological networks
Engineering planar-separator and shortest-path algorithms