Non-approximability results for optimization problems on bounded degree instances

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 453-461

  Trevisan, L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; GRAPH THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COMBINATORIAL OPTIMIZATION;

SET THEORY;

EID: 0034826228     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380839     Document Type: Conference Paper

References (30)

1. Derandomized graph products
2. Approximating the independence number via the θ function
3. Hardness of approximations
4. Free bits, PCP's and non-approximability - Towards tight results
5. Efficient probabilistically checkable proofs and applications to approximation
6. On some tighter inapproximability results
7. A greedy heuristic for the set-covering problem
8. Improved non-approximability results for vertex cover with density constraints
9. A threshold of ln n for approximating set cover
10. Interactive proofs and the hardness of approximating cliques
11. A tight characterization of NP with 3 query PCPs
12. A survey on independent set approximations
13. Some optimal inapproximability results
14. On bounded occurrence constraint satisfaction
15. Approximation algorithms for set covering and vertex cover problems
16. Approximation algorithms for combinatorial problems
17. Approximate graph coloring by semi-definite programming
18. On the ratio of optimal integral and fractional covers
19. On the hardness of approximating minimization problems
20. Optimization, approximation, and complexity classes
21. A parallel repetition theorem
22. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
23. A PCP characterization of NP with optimal amortized query complexity
24. Probabilistically checkable proofs with low amortized query complexity