阻断所有解的复杂性
The Complexity of Blocking All Solutions
AI总结:
本文证明大量经典组合优化问题的阻断问题都是多项式谱系第二阶段$Σ_2^p$-完备的,统一揭示了它们比NP难更难且无法用紧凑整数规划建模的共同原因。
摘要:
我们考虑用少量元素阻断某个给定组合问题的所有解的一般性问题。例如,通过仅禁止少量顶点来摧毁给定图的所有最大团。这类问题非常基础,自90年代以来已在许多互不相交的研究社区中以许多不同的名称被研究。根据上下文,它们被称为阻断问题、最关键顶点、最关键边、阻断者或顶点删除问题。尽管它们表面上很受欢迎,但在原始问题已经是NP完全的情况下,关于阻断问题的计算复杂性却出人意料地知之甚少。在本文中,我们通过证明大量阻断问题甚至比NP难更难来填补这一知识空白。也就是说,它们对于Stockmeyer多项式谱系的第二阶段,即复杂性类$Σ^p_2$是完备的。这种复杂性见解很重要,因为它们意味着所有这些问题都不能用紧凑的整数规划来建模(除非不太可能的猜想NP $= Σ_2^p$成立)。具体地,我们证明了以下阻断问题的$Σ^p_2$-完备性:可满足性、3可满足性、支配集、集合覆盖、命中集、反馈顶点集、反馈弧集、无容量设施选址、$p$-中心、$p$-中位、独立集、团、子集和、背包、哈密顿路径/回路(有向/无向)、TSP、$k$条有向顶点不相交路径($k \geq 2$)、Steiner树。我们证明所有这些问题共享一个抽象性质,该性质意味着它们的阻断对应问题是$Σ_2^p$-完备的。因此,所有这些问题“出于相同的原因”都是$Σ_2^p$-完备的。我们的结果扩展了Grüne和Wulf最近的一个框架。
英文摘要:
We consider the general problem of blocking all solutions of some given combinatorial problem with only few elements. For example, the problem of destroying all maximum cliques of a given graph by forbidding only few vertices. Problems of this kind are so fundamental that they have been studied under many different names in many different disjoint research communities already since the 90s. Depending on the context, they have been called the interdiction, most vital vertex, most vital edge, blocker, or vertex deletion problem. Despite their apparent popularity, surprisingly little is known about the computational complexity of interdiction problems in the case where the original problem is already NP-complete. In this paper, we fill that gap of knowledge by showing that a large amount of interdiction problems are even harder than NP-hard. Namely, they are complete for the second stage of Stockmeyer's polynomial hierarchy, the complexity class $Σ^p_2$. Such complexity insights are important because they imply that all these problems can not be modelled by a compact integer program (unless the unlikely conjecture NP $= Σ_2^p$ holds). Concretely, we prove $Σ^p_2$-completeness of the following interdiction problems: satisfiability, 3satisfiability, dominating set, set cover, hitting set, feedback vertex set, feedback arc set, uncapacitated facility location, $p$-center, $p$-median, independent set, clique, subset sum, knapsack, Hamiltonian path/cycle (directed/undirected), TSP, $k$ directed vertex disjoint path ($k \geq 2$), Steiner tree. We show that all of these problems share an abstract property which implies that their interdiction counterpart is $Σ_2^p$-complete. Thus, all of these problems are $Σ_2^p$-complete \enquote{for the same reason}. Our result extends a recent framework by Grüne and Wulf.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。