An Upper Bound for the Maximum Cut Mean Value
暂无分享,去创建一个
[1] János Komlós,et al. Effect of Connectivity in Associative Memory Models (Preliminary Version) , 1988, FOCS 1988.
[2] Siam J. CoMPtrr,et al. FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .
[3] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[4] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[5] Arun Jagota,et al. Approximating maximum clique with a Hopfield network , 1995, IEEE Trans. Neural Networks.
[6] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.
[7] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[8] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.
[9] Joel Friedman,et al. On the second eigenvalue and random walks in randomd-regular graphs , 1991, Comb..