文章基本信息
- 标题：Improved Approximations for General Minimum Cost Scheduling
- 本地全文：下载
- 作者：Piotr Berman, Marek Karpinski
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2001
- 卷号：2001
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We give improved trade-off results on approximating general minimum cost scheduling problems.
- 关键词：Approximation Algorithms , Guarantee Function , Minimum Cost Scheduling , Polynomial Time. , Trade-offs
