Equivalence of two linear programming relaxations for broadcast scheduling

Authors:
Samir Khuller;Yoo-Ah Kim
Affiliations:
Algorithms and Theory Group, Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, A.V. Williams Building, Room 3369, College Park, MD 20742, USA;Algorithms and Theory Group, Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, A.V. Williams Building, Room 3369, College Park, MD 20742, USA
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 4

NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Minimizing Response Time in Broadcast Scheduling

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Broadcasts in Wireless Networks

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Sequential and Parallel Algorithms for Mixed Packing and Covering

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science

Improved approximation algorithms for broadcast scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Broadcast scheduling: algorithms and complexity

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online scheduling to minimize the maximum delay factor

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Broadcast scheduling: Algorithms and complexity

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

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.