Optimal broadcast domination in polynomial time

Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination powers. Broadcast domination assigns an integer power f(v) 0 to each vertex v of a given graph, such that every vertex of the graph is within distance

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Pinar Heggernes, Daniel Lokshtanov
• Keywords: DM 2006, Dominating Set, Integer Power