Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks
From MaRDI portal
Publication:2870034
DOI10.1007/978-3-642-45278-9_24zbMath1407.68050OpenAlexW2110750134MaRDI QIDQ2870034
Publication date: 17 January 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_24
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
This page was built for publication: Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks