BROADCAST SCHEDULING PROBLEM IN SINR MODEL

DOI10.1142/S0129054114500166zbMath1360.68274OpenAlexW2098287810MaRDI QIDQ2929620

Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen

Publication date: 14 November 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054114500166

zbMATH Keywords

complexityschedulingNP-hardnessbroadcastSINRWSN

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• The capacity of wireless networks

This page was built for publication: BROADCAST SCHEDULING PROBLEM IN SINR MODEL