Login / Signup
On the Sample Complexity of MAX-CUT.
Wenceslas Fernandez de la Vega
Marek Karpinski
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
max cut
graph model
planar graphs
graph partitioning
np complete problems
spectral graph
np hard
np complete
parameter estimation
min max
hard problems