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

过程规则的群体控制:参数化复杂性与构造域

Group Control for Procedural Rules: Parameterized Complexity and Consecutive Domains

Yongjie Yang, Dinko Dimitrov

摘要:

我们认为,通过添加个人的群体控制(GCAI)在两个程序规则-共识开始尊重规则和自由开始尊重规则的群体识别的设置。据了解,GCAI的这两个规则是NP-难的,但他们是否是固定参数听话的杰出的个人的数量仍然开放。我们以肯定的方式解决这两个悬而未决的问题。此外,我们加强了NP-硬度的GCAI显示,相对于自然参数的增加的个人,GCAI的两个规则是W[2]-硬。值得注意的是,W[2]-困难的自由-开始-尊重规则成立,即使限制到一个非常特殊的情况下,个人的资格满足所谓的连续的属性。然而,对于共识开始尊重规则,在这种特殊情况下,问题变得多项式时间可解。我们还研究了一个双重限制的个人的资格满足连续的财产,并表明,在此限制GCAI的两个规则原来是多项式时间可解的。我们的约简表明W[2]-硬度也意味着关于核化和精确算法的几个下界。

英文摘要:

We consider Group Control by Adding Individuals (GCAI) in the setting of group identification for two procedural rules -- the consensus-start-respecting rule and the liberal-start-respecting rule. It is known that GCAI for both rules are NP-hard, but whether they are fixed-parameter tractable with respect to the number of distinguished individuals remained open. We resolve both open problems in the affirmative. In addition, we strengthen the NP-hardness of GCAI by showing that, with respect to the natural parameter the number of added individuals, GCAI for both rules are W[2]-hard. Notably, the W[2]-hardness for the liberal-start-respecting rule holds even when restricted to a very special case where the qualifications of individuals satisfy the so-called consecutive ones property. However, for the consensus-start-respecting rule, the problem becomes polynomial-time solvable in this special case. We also study a dual restriction where the disqualifications of individuals fulfill the consecutive ones property, and show that under this restriction GCAI for both rules turn out to be polynomial-time solvable. Our reductions for showing W[2]-hardness also imply several lower bounds concerning kernelization and exact algorithms.

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

↑