Inapproximability results for bounded variants of optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2751, Issue , 2003, Pages 27-38

  Chlebík, Miroslav ^a   Chlebíková, Janka ^b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HARDNESS; OPTIMIZATION;

APPROXIMATION LOWER BOUNDS; DEGREE GRAPHS; HARDNESS RESULT; HYPER GRAPH; INAPPROXIMABILITY; MAXIMUM INDEPENDENT SETS; OPTIMIZATION PROBLEMS; SET PACKING;

GRAPH THEORY;

EID: 35248836515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_4     Document Type: Article

References (15)

1. N. Alon and N. Kahale: Approximating the independent number via the θ function, Mathematical Programming 80(1998), 253-264.
2. P. Berman and T. Fujito: Approximating independent sets in degree 3 graphs, Proc. of the 4th WADS, LNCS 955, 1995, Springer, 449-460.
3. P. Berman and M. Karpinski: On Some Tighter Inapproximability Results, Further Improvements, ECCC Report TR98-065, 1998.
4. P. Berman and M. Karpinski: Efficient Amplifiers and Bounded Degree Optimization, ECCC Report TR01-053, 2001.
5. M. Chlebík and J. Chlebíková: Approximation Hardness for Small Occurrence Instances of NP-Hard Problems, Proc. of the 5th CIAC, LNCS 2653, 2003, Springer (also ECCC Report TR02-73, 2002).
6. M. Chlebík and J. Chlebíková: Approximation Hardness of the Steiner Tree Problem on Graphs, Proc. of the 8th SWAT, LNCS 2368, 2002, Springer, 170-179.
7. M. Chlebík and J. Chlebíková: Inapproximability results for bounded variants of optimization problems, ECCC Report TR03-26, 2003.
8. F. R. K. Chung: Spectral Graph Theory, CBMS Regional Conference Series in Mathematics, AMS, 1997, ISSN 0160-7642, ISBN 0-8218-0315-8.
9. A. Clementi and L. Trevisan: Improved non-approximability results for vertex cover with density constraints, Theoretical Computer Science 225(1999), 113-128.
10. I. Dinur and S. Safra: The importance of being biased, ECCC Report TR01-104, 2001.
11. J. Håstad: Some optimal inapproximability results, Journal of ACM 48(2001), 798-859.
12. E. Hazan, S. Safra and O. Schwartz: On the Hardness of Approximating k-Dimensional Matching, ECCC Report TR03-20, 2003.
13. D. Karger, R. Motwani and M. Sudan: Approximate graph coloring by semi-definite programming, Journal of the ACM 45(2)(1998), 246-265.
14. C. H. Papadimitriou and S. Vempala: On the Approximability of the Traveling Salesman Problem, In Proc. 32nd ACM Symposium on Theory of Computing, Portland, 2000.
15. L. Trevisan: Non-approximability results for optimization problems on bounded degree instances, In Proc. 33rd ACM Symposium on Theory of Computing, 2001.