Login / Signup
Simultaneous Max-Cut is harder to approximate than Max-Cut.
Amey Bhangale
Subhash Khot
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
max cut
np hard
np complete problems
np complete
graph model
planar graphs
graph partitioning
spectral graph
special case
clustering algorithm
search space
optimal solution
scheduling problem
unsupervised learning
approximation algorithms