- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Acceleration of Shortest Path and Constrained Shortest Path Computation ; 2004, 42
Preprint Reihe Mathematik ; 2004, 42
- Klassifikation
-
Mathematik
- Urheber
-
Köhler, Ekkehard
Möhring, Rolf H.
Schilling, Heiko
- DOI
-
10.14279/depositonce-14287
- Handle
-
11303/15514
- URN
-
urn:nbn:de:101:1-2022011306594572633389
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
08.02.2023, 14:02 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
- Köhler, Ekkehard
- Möhring, Rolf H.
- Schilling, Heiko
Ähnliche Objekte (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
Towards shortest path identification on large networks
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
Towards shortest path identification on large networks
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
Towards shortest path identification on large networks