A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
From MaRDI portal
Publication:2498983
DOI10.1007/s10878-006-7128-7zbMath1130.90052MaRDI QIDQ2498983
Prudence W. H. Wong, Wun-Tat Chan, Hong Shen, Yong Zhang, Hong Zhu, Francis Y. L. Chin
Publication date: 14 August 2006
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/53595
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for concave one-dimensional dynamic programming
- Scheduling broadcasts in wireless networks
- Multicast pull scheduling: When fairness is fine
- Algorithms for minimizing response time in broadcast scheduling
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
- Improved approximation algorithms for broadcast scheduling