Local search, reducibility and approximability of NP-optimization problems
- 1 April 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 54 (2) , 73-79
- https://doi.org/10.1016/0020-0190(95)00006-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximate solution of NP optimization problemsTheoretical Computer Science, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Completeness in approximation classesInformation and Computation, 1991
- How easy is local search?Journal of Computer and System Sciences, 1988
- 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