Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-08-18 , DOI: 10.1016/j.tcs.2020.07.032 Rajiv Gandhi; Magnús M. Halldórsson; Christian Konrad; Guy Kortsarz; Hoon Oh
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 -approximation algorithm, where d is the average degree and n the number of vertices in the graph, and show that the problem is -hard (and -hard) to approximate even on bipartite graphs, for any , rendering our algorithm essentially optimal. We also obtain a -approximation in interval graphs.