Budgeted Dominating Sets in Uncertain Graphs

by   Keerti Choudhary, et al.

We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, namely, graphs with a probability distribution p associated with the edges, such that an edge e exists in the graph with probability p(e). The input to the problem consists of a vertex-weighted uncertain graph =(V, E, p, ω) and an integer budget (or solution size) k, and the objective is to compute a vertex set S of size k that maximizes the expected total domination (or total weight) of vertices in the closed neighborhood of S. We refer to the problem as the Probabilistic Budgeted Dominating Set (PBDS) problem and present the following results. We show that the PBDS problem is NP-complete even when restricted to uncertain trees of diameter at most four. This is in sharp contrast with the well-known fact that the BDS problem is solvable in polynomial time in trees. We further show that PBDS is -hard for the budget parameter k, and under the Exponential time hypothesis it cannot be solved in n^o(k) time. * We show that if one is willing to settle for (1-ϵ) approximation, then there exists a PTAS for PBDS on trees. Moreover, for the scenario of uniform edge-probabilities, the problem can be solved optimally in polynomial time. * We consider the parameterized complexity of the PBDS problem, and show that Uni-PBDS (where all edge probabilities are identical) is -hard for the parameter pathwidth. On the other hand, we show that it is FPT in the combined parameters of the budget k and the treewidth. * Finally, we extend some of our parameterized results to planar and apex-minor-free graphs.



There are no comments yet.


page 1

page 2

page 3

page 4


Parameterized algorithms for locating-dominating sets

A locating-dominating set D of a graph G is a dominating set of G where ...

New Results on Directed Edge Dominating Set

We study a family of generalizations of Edge Dominating Set on directed ...

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width

A semitotal dominating set of a graph G with no isolated vertex is a dom...

Finding Dominating Induced Matchings in S_1,1,5-Free Graphs in Polynomial Time

Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...

On vertex-edge and independent vertex-edge domination

Given a graph G = (V,E), a vertex u ∈ V ve-dominates all edges incident ...

On the Complexity of Solution Extension of Optimization Problems

The question if a given partial solution to a problem can be extended re...

Multistage Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...
This week in AI

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