Login / Signup

Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING.

Philip N. KleinHsueh-I Lu
Published in: STOC (1996)
Keyphrases
  • approximation algorithms
  • semidefinite
  • np hard
  • max cut
  • worst case
  • special case
  • primal dual
  • semidefinite programming
  • minimum cost
  • higher dimensional
  • genetic algorithm
  • computational complexity