Polynomial time approximation of dense weighted instances of MAX-CUT.
Wenceslas Fernandez de la VegaMarek KarpinskiPublished in: Random Struct. Algorithms (2000)
Keyphrases
- max cut
- polynomial time approximation
- np hard
- np complete problems
- spectral graph
- np complete
- graph model
- approximation algorithms
- graph coloring
- planar graphs
- phase transition
- graph partitioning
- scheduling problem
- lower bound
- error bounds
- linear programming
- worst case
- special case
- optimal solution
- randomly generated
- minimum cost
- sat problem
- theoretic framework
- bin packing
- weighted graph
- lower and upper bounds
- clustering method
- approximation ratio
- pairwise