Radio aggregation scheduling

Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh

Research output: Contribution to journalArticlepeer-review


We consider the aggregation problem in radio networks: find a spanning tree in a given graph and a conflict-free schedule of the edges so as to minimize the latency of the computation. While a large body of literature exists on this and related problems, we give the first approximation results in graphs that are not induced by unit ranges in the plane. We give a polynomial-time O˜(dn)-approximation algorithm, where d is the average degree and n the number of vertices in the graph, and show that the problem is Ω(n1−ϵ)-hard (and Ω((dn)1/2−ϵ)-hard) to approximate even on bipartite graphs, for any ϵ>0, rendering our algorithm essentially optimal. We also obtain a O(log⁡n)-approximation in interval graphs.

Original languageEnglish
Pages (from-to)143-153
Number of pages11
JournalTheoretical Computer Science
StatePublished - 6 Nov 2020
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2020


  • Approximation algorithms
  • Data aggregation
  • Radio networks


Dive into the research topics of 'Radio aggregation scheduling'. Together they form a unique fingerprint.

Cite this