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.