An upper bound for the maximum cut mean value
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 78-84
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some optimal inapproximability results1997
- Approximating maximum clique with a Hopfield networkIEEE Transactions on Neural Networks, 1995
- .879-approximation algorithms for MAX CUT and MAX 2SAT1994
- Effect of connectivity in an associative memory modelJournal of Computer and System Sciences, 1993
- On the second eigenvalue and random walks in randomd-regular graphsCombinatorica, 1991
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Reducibility among Combinatorial Problems1972