Radio Aggregation Scheduling

4 years 2 months ago
Radio Aggregation Scheduling
We consider the aggregation problem in radio networks: nd a spanning tree in a given graph and a conict-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 rst 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 target geometrically dened graph classes, and in particular obtain a O(log n)-approximation in interval graphs.
Rajiv Gandhi, Magnús M. Halldórsson,
Added 15 Apr 2016
Updated 15 Apr 2016
Type Journal
Year 2015
Authors Rajiv Gandhi, Magnús M. Halldórsson, Christian Konrad, Guy Kortsarz, Hoon Oh
Comments (0)