Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
暂无分享,去创建一个
[1] Jonas Holmerin. Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.
[2] Venkatesan Guruswami. Inapproximability results for set splitting and satisfiability problems with no mixed clauses , 2000, APPROX.
[3] Mihir Bellare,et al. Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[4] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[5] Alessandro Panconesi,et al. Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems , 1996, Inf. Process. Lett..
[6] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[7] David P. Williamson,et al. A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.
[8] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[9] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[10] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[11] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[12] 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.
[13] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.