Optimization, approximation, and complexity classes

Journal of Computer and System Sciences

Volumn 43, Issue 3, 1991, Pages 425-440

  Papadimitriou, Christos H ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; MATHEMATICAL TECHNIQUES - APPROXIMATION THEORY;

COMPLEXITY CLASSES; MAX NP PROBLEMS; MAX SNP PROBLEMS; NP PROBLEMS;

OPTIMIZATION;

EID: 0026366408     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(91)90023-X     Document Type: Article

References (20)

1. Recursive construction for 3-regular expanders
2. On the structure of combinatorial problems and structure preserving reductions
3. Structure preserving reductions among convex optimization problems
4. Toward a unified approach for the classification of NP-complete optimization problems
5. On the complexity of approximating the independent set problem
6. The complexity of Theorem Proving Procedures
7. Generalized first-order spectra and polynomial-time recognizable sets
8. The complexity of near optimal graph coloring
9. Approximation algorithms for combinatorial problems
10. Reducibility among combinatorial problems
11. The complexity of optimization problems
12. The decision problem for the probabilities of higher-order properties
13. On Approximation Preserving Reductions: Complete Problems and Robust Measures
14. Some example of difficult traveling saleman problems
15. Non-deterministic polynomial optimization problems and their approximation
16. Planar 3-colorability is NP-complete
17. How well can a graph be n-colored?