Radio aggregation scheduling
DOI10.1016/J.TCS.2020.07.032zbMATH Open1455.68138OpenAlexW3053311671MaRDI QIDQ2202004FDOQ2202004
Authors: Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh 
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.032
Recommendations
- Approximation for a scheduling problem with application in wireless networks
- An approximation algorithm for the wireless gathering problem
- An Approximation Algorithm for the Wireless Gathering Problem
- Latency Constrained Aggregation in Chain Networks Admits a PTAS
- Constant-approximation for optimal data aggregation with physical interference
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Optimal deterministic broadcasting in known topology radio networks
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation
- A lower bound for radio broadcast
- Zero knowledge and the chromatic number
- Sublogarithmic approximation for telephone multicast
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- Approximation Algorithms for Minimum-Time Broadcast
- Message Multicasting in Heterogeneous Networks
- Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Radio aggregation scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202004)
