Improved Approximation Algorithms for Minimum Power Covering Problems

WAOA, pp. 134-148, 2018.

Cited by: 3|Bibtex|Views14|Links
EI

Abstract:

Given an undirected 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 wireless networks, we consider two network design problems under the power minimization criteria. In both problems we are given a graph (G=...More

Code:

Data:

Your rating :
0

 

Tags
Comments