Integer programming as a framework for optimization and approximability

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1996, Pages 249-259

  Barland, Ian ^a   Kolaitis, Phokion G ^a   Thakur, Madhukar N ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS;

CONSTANT APPROXIMABLE MAXIMIZATION PROBLEMS; MAX MATCHING; NP OPTIMIZATION PROBLEMS; POLYAPPROXIMABLE; POLYLOGAPPROXIMABLE; STRUCTURAL APPROXIMATION THEORY; SYNTACTIC CONDITIONS;

INTEGER PROGRAMMING;

EID: 0029711684     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)