Hochschulschrift | Online-Publikation
Constrained shortest paths and related problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2001
- Klassifikation
-
Informatik
- Schlagwort
-
Kürzester-Weg-Problem
Nebenbedingung
Relaxationsmethode
Mehrschrittverfahren
Kürzester-Weg-Problem ; Nebenbedingung ; Relaxationsmethode ; Mehrschrittverfahren
- Urheber
-
Ziegelmann, Mark
- URN
-
urn:nbn:de:bsz:291-scidok-2515
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:54 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.
Objekttyp
- Hochschulschrift
- Online-Publikation
Beteiligte
- Ziegelmann, Mark
Ähnliche Objekte (12)
Constrained shortest paths and related problems
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Unobstructed shortest paths in polyhedral environments
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Shortest edge disjoint paths in graphs
Constrained shortest paths and related problems
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Unobstructed shortest paths in polyhedral environments
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Shortest edge disjoint paths in graphs
Constrained shortest paths and related problems
Design and analysis of sequential and parallel single-source shortest paths algorithms
Shortest Paths II
Universal Shortest Paths
Shortest Paths III / Network Flows
Timetable information and shortest paths
Shortest Paths for Line Segments
Most Diverse Near-Shortest Paths
Unobstructed shortest paths in polyhedral environments
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks