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

  • Bauer J
  • Haugland D
  • Yuan D
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 8

    Citations

    Citations of this article.

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.

Author-supplied keywords

  • Analysis of algorithms
  • Approximation algorithms
  • Minimum energy broadcast
  • Wireless ad hoc network

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Joanna Bauer

  • Dag Haugland

  • Di Yuan

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free