General approximation algorithms for some arithmetical combinatorial problems
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 14 (3) , 289-303
- https://doi.org/10.1016/0304-3975(81)90047-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969