An Approximation Algorithm for the Wireless Gathering Problem

DOI10.1007/11785293_31zbMath1141.68657OpenAlexW2520092524MaRDI QIDQ5757885

Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_31

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Gathering with Minimum Delay in Tree Sensor Networks ⋮ The Distributed Wireless Gathering Problem ⋮ Collision-free path coloring with application to minimum-delay gathering in sensor networks ⋮ Optimal gathering protocols on paths under interference constraints

This page was built for publication: An Approximation Algorithm for the Wireless Gathering Problem