Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks

DOI10.1109/TCNS.2015.2512678zbMath1370.90114arXiv1403.4144OpenAlexW3100542765MaRDI QIDQ5358508

Di Yuan, Vangelis Angelakis, Qing He, Anthony Ephremides

Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.4144

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of design theory to circuits and networks (94C30)

This page was built for publication: Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks