Search: onr:"swepub:oai:DiVA.org:liu-18149" >
New results on the ...
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm
-
- Bauer, Joanna (author)
- University of Bergen
-
- Haugland, Dag (author)
- University of Bergen
-
- Yuan, Di (author)
- Linköpings universitet,Tekniska högskolan,Kommunikations- och transportsystem
-
(creator_code:org_t)
- Elsevier BV, 2009
- 2009
- English.
-
In: INFORMATION PROCESSING LETTERS. - : Elsevier BV. - 0020-0190. ; 109:12, s. 615-619
- Related links:
-
https://liu.diva-por... (primary) (Raw object)
-
show more...
-
http://liu.diva-port...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Keyword
- Approximation algorithms
- Analysis of algorithms
- Wireless ad hoc network
- Minimum energy broadcast
- TECHNOLOGY
- TEKNIKVETENSKAP
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database