The value of strong inapproximability results for clique
暂无分享,去创建一个
[1] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1990, BIT.
[2] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[3] A. Blum. ALGORITHMS FOR APPROXIMATE GRAPH COLORING , 1991 .
[4] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[5] Magnús M. Halldórsson,et al. Approximations of Independent Sets in Graphs , 1998, APPROX.
[6] Uriel Feige. Randomized graph products, chromatic numbers, and the Lovász ϑ-function , 1997, Comb..
[7] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[8] Aravind Srinivasan,et al. Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.
[9] Uriel Feige,et al. Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.
[10] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[11] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[12] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[13] Aravind Srinivasan,et al. Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..