在邻居帮助下找到最佳解决方案
Finding Optimal Solutions With Neighborly Help
摘要:
我们能否有效地从最优解到邻近的最优解计算出困难问题实例的最优解(即,本地修改)实例?例如,我们是否可以从所有单边删除子图的最优着色中有效地计算出一个图的最优着色?研究这些问题不仅可以详细了解问题本身的结构,还可以了解相关问题的复杂性;最值得注意的是图论的关键图的核心概念(例如,其色数在任意边的删除下减小的图)和最小问题的复杂性理论概念(也称为临界问题,例如,识别当任意边被删除时变为3-可着色的图)。我们专注于两个典型的图的问题,着色性和顶点覆盖。例如,我们表明,它是NP-难计算的最佳着色图的最佳着色,其所有的一个顶点删除的子图,这仍然是真实的,即使当所有的一个边删除的子图的最佳解决方案。相比之下,从所有(甚至只有两个)一个边缘添加的超图计算最佳着色是在P.我们观察到,顶点覆盖表现出显着不同的行为,展示了我们的模型的力量,更精确地描绘彼此的问题在结构层面上。此外,我们提供了一些新的复杂性结果的极小性和临界性问题。例如,我们证明了最小-3-UnColorability是完整的DP(NP集的差异),这是以前只知道更顺从的情况下删除顶点,而不是边缘。对于顶点覆盖,我们证明了对于Theta_2^p(并行访问NP),识别β-顶点临界图是完全的,获得了该类临界问题的第一个完全性结果。
英文摘要:
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory's core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic notion of minimality problems (also called criticality problems, e.g., recognizing graphs that become 3-colorable when an arbitrary edge is deleted). We focus on two prototypical graph problems, Colorability and Vertex Cover. For example, we show that it is NP-hard to compute an optimal coloring for a graph from optimal colorings for all its one-vertex-deleted subgraphs, and that this remains true even when optimal solutions for all one-edge-deleted subgraphs are given. In contrast, computing an optimal coloring from all (or even just two) one-edge-added supergraphs is in P. We observe that Vertex Cover exhibits a remarkably different behavior, demonstrating the power of our model to delineate problems from each other more precisely on a structural level. Moreover, we provide a number of new complexity results for minimality and criticality problems. For example, we prove that Minimal-3-UnColorability is complete for DP (differences of NP sets), which was previously known only for the more amenable case of deleting vertices rather than edges. For Vertex Cover, we show that recognizing beta-vertex-critical graphs is complete for Theta_2^p (parallel access to NP), obtaining the first completeness result for a criticality problem for this class.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。