Completeness in approximation classes
- 1 August 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 93 (2) , 241-262
- https://doi.org/10.1016/0890-5401(91)90025-w
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- The complexity of optimization problemsJournal of Computer and System Sciences, 1988
- 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
- Non deterministic polynomial optimization problems and their approximationsTheoretical Computer Science, 1981
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- Structure preserving reductions among convex optimization problemsJournal of Computer and System Sciences, 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