Gadgets, Approximation, and Linear Programming
暂无分享,去创建一个
[1] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[2] Uriel Feige,et al. Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[3] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[4] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[5] Luca Trevisan. Parallel Approximation Algorithms by Positive Linear Programming , 1998, Algorithmica.
[6] Luca Trevisan,et al. Positive Linear Programming, Parallel Approximation and PCP's , 1996, ESA.
[7] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[8] David P. Williamson,et al. New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..
[9] Luca Trevisan,et al. MAX NP-Completeness Made Easy , 1997, Electron. Colloquium Comput. Complex..
[10] Mihalis Yannakakis,et al. On the approximation of maximum satisfiability , 1992, SODA '92.
[11] Mihir Bellare,et al. Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..
[12] Luca Trevisan,et al. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems , 2001, Inf. Comput..
[13] V. Rich. Personal communication , 1989, Nature.
[14] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[15] Takao Asano,et al. An Approximation Algorithm for MAX 3-SAT , 1995, ISAAC.
[16] Satissed Now Consider. Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .
[17] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[18] SudanMadhu,et al. Proof verification and the hardness of approximation problems , 1998 .
[19] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[20] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[21] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[22] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[23] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[24] Luca Trevisan,et al. To Weight or Not to Weight: Where is the Question? , 1996, ISTCS.
[25] Takao Asano,et al. Approximation Algorithms for the Maximum Satisfiability Problem , 1996, Nord. J. Comput..