Completeness in approximation classes
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 116-126
- https://doi.org/10.1007/3-540-51498-8_11
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- On simple and creative sets in NPTheoretical Computer Science, 1986
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Approximation algorithms for combinatorial problemsPublished by Association for Computing Machinery (ACM) ,1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971