An approximation algorithm for the wireless gathering problem

DOI10.1016/j.orl.2008.06.001zbMath1210.90035OpenAlexW2143937928MaRDI QIDQ957364

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

Publication date: 27 November 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.06.001

zbMATH Keywords

approximation algorithmswireless networksdata gathering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (7)

Round weighting problem and gathering in radio networks with symmetrical interference ⋮ Optimal time data gathering in wireless networks with multidirectional antennas ⋮ The distributed wireless gathering problem ⋮ Scheduling problems in transportation networks of line topology ⋮ Data gathering and personalized broadcasting in radio grids with interference ⋮ GATHERING RADIO MESSAGES IN THE PATH ⋮ Optimal gathering in radio grids with interference

Cites Work

• Unnamed Item
• Multiple Communication in Multihop Radio Networks
• Gathering Algorithms on Paths Under Interference Constraints

This page was built for publication: An approximation algorithm for the wireless gathering problem