Exzellenzportal der Leibnizpreisträger der Deutschen Forschungsgemeinschaft
Homepage
Search
Project
Participating prize winners
Partners
Subject Areas
Contact
Help
Imprint
Privacy Policy
Accessibility
A
A
A
Back to result list
Search within document
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Author / Editor
: Gairing, Martin ; Monien, Burkhard
Place of publication
: Berlin [u.a.] |
Year of Publication
: 2005 |
Publisher
: Springer
Call number
: München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839
[Search within document]
[PDF-Download]
50%
100%
150%
-10
-5
-1
Scan
+1
+5
+10
50%
100%
150%
-10
-5
-1
Scan
+1
+5
+10