New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm

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.