Are stable instances easy?
Abstract
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NPhard problems are easier to solve. In particular, whether there exist algorithms that solve correctly and in polynomial time all sufficiently stable instances of some NPhard problem. The paper focuses on the MaxCut problem, for which we show that this is indeed the case.
 Publication:

arXiv eprints
 Pub Date:
 June 2009
 arXiv:
 arXiv:0906.3162
 Bibcode:
 2009arXiv0906.3162B
 Keywords:

 Computer Science  Computational Complexity
 EPrint:
 14 pages