MAX CUT in cubic graphs

[1]  Marek Karpinski,et al.  Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.

[2]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[4]  Johan Håstad,et al.  On bounded occurrence constraint satisfaction , 2000, Inf. Process. Lett..

[5]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results (Extended Abstract) , 1999, ICALP.

[6]  Uri Zwick,et al.  Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs , 1999, J. Algorithms.

[7]  Uri Zwick,et al.  Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.

[8]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[9]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[11]  S. C. Locke,et al.  Largest bipartite subgraphs in triangle-free graphs with maximum degree three , 1986 .

[12]  William Staton,et al.  Extremal bipartite subgraphs of cubic triangle-free graphs , 1982, J. Graph Theory.