Parameterized Dynamic Variants Of Red-Blue Dominating Set

Faisal N. Abu-Khzam,Cristina Bazgan,Henning Fernau

SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE（2020）

引用 1|浏览37

暂无评分

摘要

We introduce a parameterized dynamic version of the RedBlue Dominating Set problem and its partial version. We prove the fixed-parameter tractability of the dynamic versions with respect to the (so called) edit-parameter while they remain W[2]-hard with respect to the increment-parameter. We provide a complete study of the complexity of the problem with respect to combinations of the various parameters.

查看译文

关键词

Dynamic problems, Reoptimization, Parameterized complexity, Set cover, Hitting set

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要