7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.NI2014★ 7 cited
Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks
Qing He, Vangelis Angelakis, Anthony Ephremides +1
We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the t…
cs.IT2012
Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework
Vangelis Angelakis, Anthony Ephremides, Qing He +1
We consider a set of transmitter-receiver pairs, or links, that share a common channel and address the problem of emptying backlogged queues at the transmitters in minimum time. Th…