Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

DOI10.1137/S0895480104445319MaRDI QIDQ5470798zbMATH OpenOpenAlexFDO

Authors Michael Elkin, Guy Kortsarz

Publication date 1 June 2006

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480104445319

zbMATH Keywords

approximationbroadcastradio

Mathematics Subject Classification ID

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

Recommendations

• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Logarithmic inapproximability of the radio broadcast problem
• scientific article; zbMATH DE number 1670545
• Approximation Algorithms for Minimum-Time Broadcast
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cited in

(6)

• Many-to-many communication in radio networks
• Radio aggregation scheduling
• Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
• Logarithmic inapproximability of the radio broadcast problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Reception capacity: definitions, game theory and hardness

This page was built for publication: Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470798)