@article {15241,
	title = {Equivalence of two linear programming relaxations for broadcast scheduling},
	journal = {Operations Research Letters},
	volume = {32},
	year = {2004},
	month = {2004/09//},
	pages = {473 - 478},
	abstract = {A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.},
	keywords = {Approximation algorithms, Broadcasting, Linear programming, scheduling},
	isbn = {0167-6377},
	doi = {10.1016/j.orl.2003.11.012},
	url = {http://www.sciencedirect.com/science/article/pii/S016763770300169X},
	author = {Khuller, Samir and Kim,Yoo-Ah}
}
