Sökning: 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 (författare)
- University of Bergen
-
- Haugland, Dag (författare)
- University of Bergen
-
- Yuan, Di (författare)
- Linköpings universitet,Tekniska högskolan,Kommunikations- och transportsystem
-
(creator_code:org_t)
- Elsevier BV, 2009
- 2009
- Engelska.
-
Ingår i: INFORMATION PROCESSING LETTERS. - : Elsevier BV. - 0020-0190. ; 109:12, s. 615-619
- Relaterad länk:
-
https://liu.diva-por... (primary) (Raw object)
-
visa fler...
-
http://liu.diva-port...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Nyckelord
- Approximation algorithms
- Analysis of algorithms
- Wireless ad hoc network
- Minimum energy broadcast
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas