On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

@inproceedings{Clementi2001OnTC,
title={On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs},
author={Andrea E. F. Clementi and Pierluigi Crescenzi and Paolo Penna and Gianluca Rossi and Paola Vocca},
booktitle={STACS},
year={2001}
}

We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we consider this problem as a special case of the following more general combinatorial optimization problem, called Minimum Energy Consumption Broadcast Subgraph (in short, MECBS): Given a weighted directed graph and a specified source node, find a minimum cost range assignment to the nodes, whose correspondingâ€¦Â CONTINUE READING