- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
II, 104 S.
- Language
-
Deutsch
- Notes
-
graph. Darst.
Saarbrücken, Univ., Diss., 2001
- Keyword
-
Punktmenge
Kurve
Rekonstruktion
Algorithmus
Travelling-salesman-Problem
Punktmenge ; Kurve ; Rekonstruktion ; Algorithmus ; Travelling-salesman-Problem
- Creator
-
Althaus, Ernst
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:23 PM 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.
Object type
- Hochschulschrift
Associated
- Althaus, Ernst
Other Objects (12)
Curve reconstruction and the traveling salesman problem
The traveling salesman problem
Das Traveling-Salesman-Problem, [1]
Approximation Algorithms for Traveling Salesman Problems
Multiobjective traveling salesman problems and redundancy of complete sets
Multiobjective Traveling Salesman Problems and Redundancy of Complete Sets
Traveling Companions
On The Recoverable Robust Traveling Salesman Problem
Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen
Approximation Algorithms for the Traveling Salesman Problem
Parallel implementation of curve reconstruction from noisy samples
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Curve reconstruction and the traveling salesman problem
The traveling salesman problem
Das Traveling-Salesman-Problem, [1]
Approximation Algorithms for Traveling Salesman Problems
Multiobjective traveling salesman problems and redundancy of complete sets
Multiobjective Traveling Salesman Problems and Redundancy of Complete Sets
Traveling Companions
On The Recoverable Robust Traveling Salesman Problem
Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen
Approximation Algorithms for the Traveling Salesman Problem
Parallel implementation of curve reconstruction from noisy samples
Combinatorial curve reconstruction and the efficient exact implementation of geometric algorithms
Curve reconstruction and the traveling salesman problem
The traveling salesman problem
Das Traveling-Salesman-Problem, [1]
Approximation Algorithms for Traveling Salesman Problems
Multiobjective traveling salesman problems and redundancy of complete sets
Multiobjective Traveling Salesman Problems and Redundancy of Complete Sets
Traveling Companions
On The Recoverable Robust Traveling Salesman Problem
Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen
Approximation Algorithms for the Traveling Salesman Problem
Parallel implementation of curve reconstruction from noisy samples