Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

36

DM
2006

favoriteEmaildiscussreport

108views more DM 2006»

Optimal broadcast domination in polynomial time

13 years 11 months ago

Optimal broadcast domination in polynomial time

Download www.ii.uib.no

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

Pinar Heggernes, Daniel Lokshtanov

Real-time Traffic

DM 2006 | Dominating Set | Integer Power |

claim paper

Related Content

» Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time

» Polynomial Time Data Reduction for Dominating Set

» Broadcasting and Multicasting in Cutthrough Routed Networks

» Broadcast Disks with Polynomial Cost Functions

» Domination analysis for minimum multiprocessor scheduling

» Optimizing Data Placement over Wireless Broadcast Channel for MultiDimensional Range Query...

» Optimal and NearOptimal EnergyEfficient Broadcasting in Wireless Networks

» A PolynomialTime Approximation Algorithm for Weighted SumRate Maximization in UWB Networks

» Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DM
Authors	Pinar Heggernes, Daniel Lokshtanov

Comments (0)