Approximability of NP-hard problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 337-348

  Arora, Sanjeev ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY;

CONSTRAINT SATISFACTION PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0031625439     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276784     Document Type: Conference Paper

References (128)