- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540176299
3540176292
9780387176291
0387176292
- Maße
-
25 cm
- Umfang
-
103 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturverz. S. 93 - 103
- Erschienen in
-
Lecture notes in computer science ; Vol. 251
- Schlagwort
-
Polyeder
Kürzester-Weg-Problem
Polyeder
Problem des kürzesten Weges
Polyeder
Travelling-salesman-Problem
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg, New York, London, Paris, Tokyo
- (wer)
-
Springer
- (wann)
-
1987
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:08 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
- Akman, Varol
- Springer
Entstanden
- 1987
Ähnliche Objekte (12)
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
Constrained shortest paths and related problems
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Shortest edge disjoint paths in graphs
Constrained shortest paths and related problems
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
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
Constrained shortest paths and related problems
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Shortest edge disjoint paths in graphs
Constrained shortest paths and related problems
A multi-objective approach for PH-graphs with applications to stochastic shortest paths
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
Constrained shortest paths and related problems
Drawing Shortest Paths in Geodetic Graphs
Encoding Shortest Paths in Spatial Networks
Shortest edge disjoint paths in graphs
Constrained shortest paths and related problems