Hochschulschrift
Approximation and online algorithms in scheduling and coloring
- 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.03.2025, 11:48 AM 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 and online algorithms in scheduling and coloring
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Models and algorithms for stochastic online scheduling
Online Algorithms for Scheduling and Data Management
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
On optimality of exact and approximation algorithms for scheduling problems
Online algorithms for packet scheduling and buffer management
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Models and algorithms for stochastic online scheduling
Online Algorithms for Scheduling and Data Management
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
On optimality of exact and approximation algorithms for scheduling problems
Online algorithms for packet scheduling and buffer management
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for scheduling and two-dimensional packing problems
Models and algorithms for stochastic online scheduling
Online Algorithms for Scheduling and Data Management
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Scheduling jobs with communication delays : complexity results and approximation algorithms
On optimality of exact and approximation algorithms for scheduling problems