Login / Signup

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut.

Lukas MichelAlex Scott
Published in: CoRR (2023)
Keyphrases
  • max cut
  • computational complexity
  • genetic algorithm
  • worst case
  • graph model
  • graph partitioning
  • clustering algorithm
  • data clustering
  • np complete problems