Are Stable Instances Easy?
Are Stable Instances Easy?
复制标题
DOI：
10.1017/s0963548312000193
复制
发表时间：
2012-09-01
影响因子：
0.9
通讯作者：
Linial, Nathan
中科院分区：
文献类型：
--
作者：
Bilu, Yonatan;Linial, Nathan
我们介绍了一个稳定实例的概念，即一个离散的优化问题，并认为在许多实际情况下，只有足够稳定的实例就引起了人们的关注。然后出现了一个问题，是否易于解决NP硬问题问题的稳定实例，特别是在多项式时间中是否存在算法，这是某些NP-硬问题问题的足够稳定的实例。该论文重点介绍了最大切割问题，我们表明确实如此。
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.