On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms.

Jun Xu Richard J. Lipton On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms. 15-28 2005 13 IEEE/ACM Trans. Netw. 1 http://portal.acm.org/citation.cfm?id=1056408.1056411 db/journals/ton/ton13.html#XuL05