- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
X, 152 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Kiel, Univ., Diss., 2002 (Nur als Mikrofiches für den Austausch)
- Classification
-
Informatik
Mathematik
- Keyword
-
Reihenfolgeproblem
NP-hartes Problem
Approximationsalgorithmus
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:13 PM CET
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
Other Objects (12)
Approximation Schemes for Machine Scheduling
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Improved approximation schemes for the restricted shortest path problem
Approximation algorithms for scheduling with reservations.
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
On optimality of exact and approximation algorithms for scheduling problems
Adaptive control schemes for parameterized heuristic scheduling
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Approximation and randomization in scheduling
Approximation Schemes for Machine Scheduling
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Improved approximation schemes for the restricted shortest path problem
Approximation algorithms for scheduling with reservations.
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
On optimality of exact and approximation algorithms for scheduling problems
Adaptive control schemes for parameterized heuristic scheduling
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem
Approximation and randomization in scheduling
Approximation Schemes for Machine Scheduling
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Improved approximation schemes for the restricted shortest path problem
Approximation algorithms for scheduling with reservations.
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
On optimality of exact and approximation algorithms for scheduling problems
Adaptive control schemes for parameterized heuristic scheduling
Fully-polynomial-time approximation schemes for the Euclidean shortest path problem