Approximating minimum-power edge-covers and image-connectivity Original Research Article

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