arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.04553cs.CC
收藏

关于最优化问题解扩张的复杂性

On the Complexity of Solution Extension of Optimization Problems

Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora

摘要:

问题,如果一个给定的部分解决方案的问题,可以合理地扩展出现在许多算法的方法优化问题。例如,在计算图$G=(V,E)$的最小控制集时,如果存在一个\textit{minimal}支配集$S$,且$U\subseteq S$为$G=(V,E)$的最小控制集,则通常会得到一个顶点集$U \subseteq V$的判定问题.我们提出了一个一般的,基于偏序的制定这样的扩展问题,并研究了一些具体的问题,可以表示在这个框架。可能与直觉相矛盾的是,这些问题往往是NP难的,即使对于底层优化问题可以在多项式时间内解决的问题也是如此。这就提出了一个问题,即如何修复部分解决方案会导致难度增加。在这方面,我们研究的参数化的复杂性的扩展问题的参数相关的部分解决方案,以及简单的精确算法的最优性下的指数时间假设。所有的复杂性考虑也进行了非常有限的情况下,无论是度限制或拓扑限制(平面性)的图形问题或给定分区的大小为考虑的扩展变型装箱。

英文摘要:

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually arrives at the problem to decide for a vertex set $U \subseteq V$, if there exists a \textit{minimal} dominating set $S$ with $U\subseteq S$. We propose a general, partial-order based formulation of such extension problems and study a number of specific problems which can be expressed in this framework. Possibly contradicting intuition, these problems tend to be NP-hard, even for problems where the underlying optimisation problem can be solved in polynomial time. This raises the question of how fixing a partial solution causes this increase in difficulty. In this regard, we study the parameterised complexity of extension problems with respect to parameters related to the partial solution, as well as the optimality of simple exact algorithms under the Exponential-Time Hypothesis. All complexity considerations are also carried out in very restricted scenarios, be it degree restrictions or topological restrictions (planarity) for graph problems or the size of the given partition for the considered extension variant of Bin Packing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑