Sciweavers

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

21

CORR
2011
Springer

favoriteEmaildiscussreport

179views Education» more CORR 2011»

Approximating minimum-power edge-multicovers

12 years 8 months ago

Approximating minimum-power edge-multicovers

Download www.openu.ac.il

Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph

Nachshon Cohen, Zeev Nutov

Real-time Traffic

CORR 2011 | Edge Costs | Education | Ratios | Wireless Network |

claim paper

Related Content

» On Minimum Power Connectivity Problems

» Approximating MinimumPower kConnectivity

» Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Prob...

» Approximating MinimumPower Degree and Connectivity Problems

» Minimum power assignment in wireless ad hoc networks with spanner property

» On the nodescheduling approach to topology control in ad hoc networks

Post Info
More Details (n/a)

Added	20 Aug 2011
Updated	20 Aug 2011
Type	Journal
Year	2011
Where	CORR
Authors	Nachshon Cohen, Zeev Nutov

Comments (0)