时间复杂度为O*（2^n）
Beyond O*(2^n) in domination-type problems
摘要：
在本文中，我们为几个NP完全支配型问题提供了比O*（2^n）更快的算法。更准确地说，我们提供：CAPACITATED支配集的求解时间为O（1.89^n），最大不冗余集的求解时间为O（1.9657^n），最小包含-最大不冗余集的求解时间为O（1.999956^n）。我们还提供了一个指数逼近方案的电容支配集。所有算法都需要多项式空间。尽管所讨论的问题与支配集问题非常相似，但在本文之前，我们还没有发现任何已发表的算法比明显的O*（2^n）解更快地解决这些问题。
英文摘要：
In this paper we provide algorithms faster than O*(2^n) for several NP-complete domination-type problems. More precisely, we provide: an algorithm for CAPACITATED DOMINATING SET that solves it in O(1.89^n), a branch-and-reduce algorithm solving LARGEST IRREDUNDANT SET in O(1.9657^n) time and a simple iterative-DFS algorithm for SMALLEST INCLUSION-MAXIMAL IRREDUNDANT SET that solves it in O(1.999956^n) time. We also provide an exponential approximation scheme for CAPACITATED DOMINATING SET. All algorithms require polynomial space. Despite the fact that the discussed problems are quite similar to the DOMINATING SET problem, we are not aware of any published algorithms solving these problems faster than the obvious O*(2^n) solution prior to this paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
