Parameterized Complexity of Minimum Membership Dominating Set

10/13/2021
by   Akanksha Agrawal, et al.
0

Given a graph G=(V,E) and an integer k, the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set S ⊆ V of G such that for each v ∈ V, |N[v] ∩ S| is at most k. We investigate the parameterized complexity of the problem and obtain the following results about MMDS: W[1]-hardness of the problem parameterized by the pathwidth (and thus, treewidth) of the input graph. W[1]-hardness parameterized by k on split graphs. An algorithm running in time 2^𝒪(vc) |V|^𝒪(1), where vc is the size of a minimum-sized vertex cover of the input graph. An ETH-based lower bound showing that the algorithm mentioned in the previous item is optimal.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/27/2019

Algorithm and Hardness results on Liar's Dominating Set and k-tuple Dominating Set

Given a graph G=(V,E), the dominating set problem asks for a minimum sub...
11/20/2019

Towards a Theory of Parameterized Streaming Algorithms

Parameterized complexity attempts to give a more fine-grained analysis o...
06/12/2019

Decremental Optimization of Dominating Sets Under Reachability Constraints

Given a dominating set, how much smaller a dominating set can we find th...
11/20/2019

New Algorithms for Mixed Dominating Set

A mixed dominating set is a collection of vertices and edges that domina...
06/04/2020

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts

To monitor electrical activity throughout the power grid and mitigate ou...
07/13/2021

Towards exact structural thresholds for parameterized complexity

Parameterized complexity seeks to use input structure to obtain faster a...
02/14/2020

A Breezing Proof of the KMW Bound

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.