Optimization, approximation, and complexity classes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 229-234

  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

OPTIMIZATION;

APPROXIMABILITY; BOUNDED ERRORS; COMPLETE PROBLEMS; COMPLEXITY CLASS; L-REDUCTION; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

APPROXIMATION THEORY;

EID: 84898928682     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62233     Document Type: Conference Paper

References (0)