ECCC - TR01-097

ECCC

Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login

Register

Classic Style

REPORTS > DETAIL:

Paper:

TR01-097 | 11th December 2001 00:00

Improved Approximations for General Minimum Cost Scheduling

Contact

Add Comment

TR01-097 Authors: Piotr Berman, Marek Karpinski
Publication: 11th December 2001 10:04
Downloads: 3714

Keywords:

Approximation Algorithms, Guarantee Function, Minimum Cost Scheduling, polynomial time, Trade-offs

Abstract:

We give improved trade-off results on approximating general
minimum cost scheduling problems.

ISSN 1433-8092 | Imprint