- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
VIII, 234 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Kiel, Univ., Diss., 2003
- Classification
-
Informatik
Mathematik
- Keyword
-
Reihenfolgeproblem
Graphmarkierung
NP-hartes Problem
Approximationsalgorithmus
Online-Algorithmus
- 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.06.2025, 1:38 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
Other Objects (12)
Approximation and online algorithms in scheduling and coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Approximation algorithms for packing and scheduling problems
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
On optimality of exact and approximation algorithms for scheduling problems
Approximation and online algorithms in scheduling and coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Approximation algorithms for packing and scheduling problems
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
On optimality of exact and approximation algorithms for scheduling problems
Approximation and online algorithms in scheduling and coloring
Parameterized and Approximation Algorithms for the Load Coloring Problem
Approximation algorithms for the interval constrained coloring problem
Approximation algorithms for packing and scheduling problems
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems