Are stable instances easy?

Yonatan Bilu*, Nathan Linial

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

55 Scopus citations


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 NP-hard problems are easier to solve, and in particular, whether there exist algorithms that solve in polynomial time all sufficiently stable instances of some NP-hard problem. The paper focuses on the Max-Cut problem, for which we show that this is indeed the case.

Original languageAmerican English
Pages (from-to)643-660
Number of pages18
JournalCombinatorics Probability and Computing
Issue number5
StatePublished - Sep 2012


Dive into the research topics of 'Are stable instances easy?'. Together they form a unique fingerprint.

Cite this