Article ID Journal Published Year Pages File Type
436029 Theoretical Computer Science 2015 4 Pages PDF
Abstract

In this paper we prove that the Minimum Latency Aggregation Scheduling (MLAS) problem in the Signal-to-Interference-Noise-Ratio (SINR) model is APX-hard in the uniform power model.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
Authors
, , , ,