Recent developments on the approximability of combinatorial problems
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- Toward a unified approach for the classification of NP-complete optimization problemsTheoretical Computer Science, 1980
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph ProblemsJournal of the ACM, 1979
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975