onr:"swepub:oai:DiVA.org:liu-18149"
Search: onr:"swepub:oai:DiVA.org:liu-18149" > New results on the ...
- 1 of 1
- Previous record
- Next record
- To hitlist
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
- Journal article (peer-reviewed)
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
- INFORMATION PROCESSING LETTERS (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Bauer, Joanna
- Haugland, Dag
- Yuan, Di
- Articles in the publication
- INFORMATION PROC ...
- By the university
- Linköping University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
