Approximating Minimum Power Edge-Multi-Covers

@article{Cohen2012ApproximatingMP,
  title={Approximating Minimum Power Edge-Multi-Covers},
  author={Nachshon Cohen and Zeev Nutov},
  journal={J. Comb. Optim.},
  year={2012},
  volume={30},
  pages={563-578}
}
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 G = (V,E) with edge costs and degree bounds {r(v) : v ∈ V… CONTINUE READING