Login / Signup

Improving the Smoothed Complexity of FLIP for Max Cut Problems.

Ali BibakCharles CarlsonKarthekeyan Chandrasekaran
Published in: ACM Trans. Algorithms (2021)
Keyphrases
  • max cut
  • optimization problems
  • decision problems
  • np complete