Approximation algorithms for scheduling parallel jobs: breaking the approximation ratio of 2.
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2192-6247
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Technische Berichte des Instituts für Informatik ; Nr. 08,08
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kiel
- (wer)
-
Institut für Informatik / Christian-Albrechts-Universität zu Kiel
- (wann)
-
2008
- Urheber
- URN
-
urn:nbn:de:101:1-201203215161
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:45 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
- Jansen, Klaus
- Institut für Informatik / Christian-Albrechts-Universität zu Kiel
Entstanden
- 2008
Ähnliche Objekte (12)
Approximation algorithms for scheduling with reservations.
Approximation algorithms for packing and scheduling problems
Approximation algorithms
Approximation Algorithms
Improved approximation algorithms for packing and scheduling problems
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for scheduling and two-dimensional packing problems
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A (2 + [epsilon])-approximation for scheduling parallel jobs in platforms
On optimality of exact and approximation algorithms for scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for packing and scheduling problems
Approximation algorithms
Approximation Algorithms
Improved approximation algorithms for packing and scheduling problems
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for scheduling and two-dimensional packing problems
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A (2 + [epsilon])-approximation for scheduling parallel jobs in platforms
On optimality of exact and approximation algorithms for scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for scheduling with reservations.
Approximation algorithms for packing and scheduling problems
Approximation algorithms
Approximation Algorithms
Improved approximation algorithms for packing and scheduling problems
Approximation and online algorithms in scheduling and coloring
Approximation and online algorithms in scheduling and coloring
Approximation algorithms for scheduling and two-dimensional packing problems
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A (2 + [epsilon])-approximation for scheduling parallel jobs in platforms
On optimality of exact and approximation algorithms for scheduling problems