Non-approximability results for optimization problems on bounded degree instances
暂无分享,去创建一个
[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[2] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[3] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[4] Dorit S. Hochbaum,et al. Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..
[5] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[6] E T. Leighton,et al. Introduction to parallel algorithms and architectures , 1991 .
[7] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[9] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[10] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[11] Sanjeev Arora. Probabilistic checking of proofs and hardness of approximation problems , 1995 .
[12] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[13] Carsten Lund,et al. Hardness of approximations , 1996 .
[14] Luca Trevisan,et al. Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints , 1999, Electron. Colloquium Comput. Complex..
[15] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[16] Luca Trevisan,et al. Improved Non-approximability Results for Vertex Cover with Density Constraints , 1996, COCOON.
[17] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[18] P. Berman,et al. On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..
[19] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.
[20] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.
[21] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[22] Magnús M. Halldórsson,et al. Approximations of Independent Sets in Graphs , 1998, APPROX.
[23] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[24] Venkatesan Guruswami,et al. A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[25] Luca Trevisan,et al. Probabilistically checkable proofs with low amortized query complexity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[26] Noga Alon,et al. Approximating the independence number via theϑ-function , 1998, Math. Program..
[27] Venkatesan Guruswami. Query-efficient checking of proofs and improved PCP characterizations of NP , 1999 .
[28] Johan Håstad,et al. On bounded occurrence constraint satisfaction , 2000, Inf. Process. Lett..
[29] Luca Trevisan,et al. A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.
[30] Avi Wigderson,et al. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[31] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.