A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
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.
complexity apx-hardness wireless sensor network algorithm