Download Now Free registration required
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph. Motivated by applications in wireless multi-hop networks, the authors consider four fundamental problems under the power minimization criteria: the Min-Power b-Edge-Cover problem (MPb-EC) where the goal is to find a min-power subgraph so that the degree of every node v is at least some given integer b(v), the Min-Power k-node Connected Spanning Subgraph problem (MPk-CSS), Min-Power k-Edge Connected Spanning Subgraph problem (MPk-ECSS), and finally the Min-Power k-Edge-Disjoint Paths problem in directed graphs (MPk-EDP).
- Format: PDF
- Size: 176.1 KB