Improved Approximation Results for the Minimum Energy Broadcasting Problem


In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the Minimum-Energy Broadcast Routing (MEBR) problem. We first prove that, for any number of dimensions d ≥ 2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient α, that is the exponent to which the coverage… (More)
DOI: 10.1007/s00453-007-9077-7


1 Figure or Table


Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics