Login / Signup

MAX-CUT has a randomized approximation scheme in dense graphs.

Wenceslas Fernandez de la Vega
Published in: Random Struct. Algorithms (1996)
Keyphrases
  • max cut
  • randomized approximation
  • graph model
  • graph partitioning
  • planar graphs
  • np hard
  • np complete problems
  • spectral graph
  • min max
  • multiscale
  • np complete
  • special case
  • graph structure
  • theoretic framework