6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2003 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Khuller, S., & Kim, Y. A. (2004). Equivalence of two linear programming relaxations for broadcast scheduling. Operations Research Letters, 32(5), 473–478. https://doi.org/10.1016/j.orl.2003.11.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free