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

8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 (| 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.

Cite

CITATION STYLE

APA

Bauer, J., Haugland, D., & Yuan, D. (2009). New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm. Information Processing Letters, 109(12), 615–619. https://doi.org/10.1016/j.ipl.2009.02.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free