| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428136 | Information Processing Letters | 2009 | 5 Pages |
Abstract
The Broadcast Incremental Power (BIP) algorithm is the most frequently cited method for the minimum energy broadcast routing problem. A recent survey concluded that BIP has O(3|V|) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O(2|V|) and 4.598, respectively.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
