An upper bound for the maximum cut mean value

This publication has 8 references indexed in Scilit:

• Some optimal inapproximability results
  Published by Association for Computing Machinery (ACM) ,1997
• Approximating maximum clique with a Hopfield network
  IEEE Transactions on Neural Networks, 1995
• .879-approximation algorithms for MAX CUT and MAX 2SAT
  Published by Association for Computing Machinery (ACM) ,1994
• On the second eigenvalue and random walks in randomd-regular graphs
  Combinatorica, 1991
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
  Operations Research, 1988
• P-Complete Approximation Problems
  Journal of the ACM, 1976
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
  SIAM Journal on Computing, 1975
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972