Equivalence of two linear programming relaxations for broadcast scheduling

  • Khuller S
  • Kim Y
  • 3


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


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.

Author-supplied keywords

  • Approximation algorithms
  • Broadcasting
  • Linear programming
  • Scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Samir Khuller

  • Yoo Ah Kim

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free