- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bonn, Rheinische Friedrich-Wilhelms-Universität, Dissertation, 2020
- Klassifikation
-
Elektrotechnik, Elektronik
- Schlagwort
-
Planning
Navigation
- Ereignis
-
Veröffentlichung
- (wo)
-
Bonn
- (wer)
-
Universitäts- und Landesbibliothek Bonn
- (wann)
-
2021
- Urheber
- Handle
-
20.500.11811/9041
- URN
-
urn:nbn:de:hbz:5-61951
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:48 MESZ
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
- Nardi, Lorenzo
- Universitäts- und Landesbibliothek Bonn
Entstanden
- 2021
Ähnliche Objekte (12)
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Legibility of Robot Behavior : Investigating Legibility of Robot Navigation in Human-Robot Path Crossing Scenarios
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
Engineering planar-separator and shortest-path algorithms
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Legibility of Robot Behavior : Investigating Legibility of Robot Navigation in Human-Robot Path Crossing Scenarios
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
Engineering planar-separator and shortest-path algorithms
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest path network problems
Distributed shortest-path computation
New Multiobjective Shortest Path Algorithms
Recoverable Robust Shortest Path Problems
Variants of the Shortest Path Problem
Legibility of Robot Behavior : Investigating Legibility of Robot Navigation in Human-Robot Path Crossing Scenarios
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