Approximating minimum-power edge-multicovers

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

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Nachshon Cohen, Zeev Nutov
• Keywords: CORR 2011, Edge Costs, Education, Ratios, Wireless Network