On the integrality ratio of semidefinite relaxations of MAX CUT
暂无分享,去创建一个
[1] B. A. Taylor,et al. Spherical rearrangements, subharmonic functions, and $\ast$-functions in $n$-space , 1976 .
[2] P. Mattila. Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability , 1995 .
[3] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[4] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[5] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[6] 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.
[7] Pertti Mattila,et al. Geometry of sets and measures in Euclidean spaces , 1995 .
[8] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[9] Noga Alon,et al. Bipartite Subgraphs and the Smallest Eigenvalue , 2000, Combinatorics, Probability and Computing.
[10] Howard J. Karloff. How Good is the Goemans-Williamson MAX CUT Algorithm? , 1999, SIAM J. Comput..
[11] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[12] Uriel Feige,et al. On the optimality of the random hyperplane rounding technique for MAX CUT , 2002, Random Struct. Algorithms.