- INSTANCE:
Graph
and a source node
.
- SOLUTION:
A broadcasting scheme. At time 0 only
contains the message that is to be broadcast to every vertex. At each time step any vertex that has received the message is allowed to communicate the message to at most one of its neighbours.
- COST FUNCTION:
The broadcast time, i.e., the time when all vertices have received the message.
- OBJECTIVE:
Minimize.
*Approx.:*Approximable within [96].*Hardness:*NP-hard [52].*Comment:*Approximable within if the degree of is bounded by a constant [96]. Approximable within if is chordal, -outerplanar [78]. Approximable within if has bounded tree width [88].

2015-04-27 Revision: 288 PDF version