Approximation for a scheduling problem with application in wireless networks

DOI10.1007/s11425-010-3077-9zbMath1206.68368OpenAlexW1989170887MaRDI QIDQ989801

QingHua Zhu, Deying Li

Publication date: 23 August 2010

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-010-3077-9

zbMATH Keywords

approximation algorithmlatencywireless sensor networkconflict-awaremany-to-one data aggregation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna ⋮ An improved distributed data aggregation scheduling in wireless sensor networks

Cites Work

• Unnamed Item
• Smallest-last ordering and clustering and graph coloring algorithms
• Faster communication in known topology radio networks

This page was built for publication: Approximation for a scheduling problem with application in wireless networks