Optimal broadcast domination of arbitrary graphs in polynomial time

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broadcast domination assigns a power f (v) >= 0 to each vertex v of a given graph, such that every vertex of the graph is within distance f (v) from some vertex v having f (v) >= 1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the vertices of the graph. Since the presentation of this problem its computational complexity has been open, and the general belief has been that it might be NP-hard. In this paper, we show that optimal broadcast domination is actually in P, and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non standard approach.