Opening book details…
Can I read Optimal Broadcast Domination in Polynomial Time on EtoBox?
Optimal Broadcast Domination in Polynomial Time by Pinar Heggernes; Daniel Lokshtanov is a Computer Science article available to read on EtoBox.
What is Optimal Broadcast Domination in Polynomial Time about?
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 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.
Who reads Optimal Broadcast Domination in Polynomial Time?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Pinar Heggernes; Daniel Lokshtanov
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)