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

DOI10.1016/j.ipl.2009.02.012zbMath1209.68631OpenAlexW2103235438MaRDI QIDQ987839

Joanna Bauer, Dag Haugland, Di Yuan

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18149

zbMATH Keywords

analysis of algorithmsapproximation algorithmsminimum energy broadcastwireless ad hoc network

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (2)

A fast local search method for minimum energy broadcast in wireless ad hoc networks ⋮ Shared Multicast Trees in Ad Hoc Wireless Networks

Cites Work

• Minimum-energy broadcasting in static ad hoc wireless networks
• Automata, Languages and Programming
• Unnamed Item

This page was built for publication: New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm