Title of article
Approximating minimum-power edge-covers and image-connectivity Original Research Article
Author/Authors
Guy Kortsarz، نويسنده , , Zeev Nutov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
1840
To page
1847
Abstract
Given a graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider several fundamental undirected network design problems under the power minimization criteria. The Minimum-Power Edge-Cov
Keywords
Edge-cover , Node-connectivity , Approximation algorithms , Minimum power , Wireless networks
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887119
Link To Document