Approximate solution of NP optimization problems
- 1 October 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 150 (1) , 1-55
- https://doi.org/10.1016/0304-3975(94)00291-p
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Local search, reducibility and approximability of NP-optimization problemsInformation Processing Letters, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- A note on the approximation of the max clique problemInformation Processing Letters, 1991
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problemsInformation Processing Letters, 1990
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- On different approximation criteria for subset product problemsInformation Processing Letters, 1985
- 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
- `` Strong '' NP-Completeness ResultsJournal of the ACM, 1978
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975