Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
Wenceslas Fernandez de la VegaMarek KarpinskiPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- max cut
- polynomial time approximation
- np hard
- np complete problems
- spectral graph
- np complete
- graph model
- approximation algorithms
- graph coloring
- error bounds
- phase transition
- special case
- theoretic framework
- randomly generated
- bin packing
- planar graphs
- constraint satisfaction problems
- multiscale
- graph partitioning
- scheduling problem
- integer programming
- worst case
- lower bound
- computational complexity
- optimal solution