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 (| V |3) time complexity, and that its approximation ratio is at least 4.33. We strengthen these results to O (| V |2) and 4.598, respectively. © 2009 Elsevier B.V. All rights reserved.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below