On the hardness of global and local approximation
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 88-99
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Logical Definability of NP Optimization ProblemsInformation and Computation, 1994
- Approximating the minimum maximal independence numberInformation Processing Letters, 1993
- Polynomially bounded minimization problems which are hard to approximateLecture Notes in Computer Science, 1993
- On the complexity of approximating the independent set problemInformation and Computation, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Introduction to the Theory of Neural ComputationPhysics Today, 1991
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- Structure in locally optimal solutions1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985