Are stable instances easy - Computer Science > Computational ComplexityReport as inadecuate




Are stable instances easy - Computer Science > Computational Complexity - Download this document for free, or read online. Document in PDF available to download.

Abstract: We introduce the notion of a stable instance for a discrete optimizationproblem, and argue that in many practical situations only sufficiently stableinstances are of interest. The question then arises whether stable instances ofNP-hard problems are easier to solve. In particular, whether there existalgorithms that solve correctly and in polynomial time all sufficiently stableinstances of some NP-hard problem. The paper focuses on the Max-Cut problem,for which we show that this is indeed the case.



Author: Yonatan Bilu, Nathan Linial

Source: https://arxiv.org/







Related documents