全局约束的参数化复杂性
The Parameterized Complexity of Global Constraints
摘要:
我们认为,参数化的复杂性是一个有用的工具,研究全球的约束。特别是,我们证明了许多难以完全传播的全局约束具有自然参数,这使得它们具有易于计算的固定参数。这种易处理性往往是一个简单的动态程序或分解的结果,它有一个强大的后门的大小有界。这个强后门通常是一个循环割集。我们还表明,参数化的复杂性可以用来研究其他方面的约束规划,如对称破缺。例如,我们证明了值对称性是固定参数易破的对称性的数量。最后,我们认为,参数化的复杂性可以用来推导出的约束传播的近似性的结果。
英文摘要:
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them fixed-parameter tractable and which are easy to compute. This tractability tends either to be the result of a simple dynamic program or of a decomposition which has a strong backdoor of bounded size. This strong backdoor is often a cycle cutset. We also show that parameterized complexity can be used to study other aspects of constraint programming like symmetry breaking. For instance, we prove that value symmetry is fixed-parameter tractable to break in the number of symmetries. Finally, we argue that parameterized complexity can be used to derive results about the approximability of constraint propagation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。