Algorithms for Minimizing Response Time in Broadcast Scheduling

Authors:
Rajiv Gandhi;Samir Khuller;Yoo-Ah Kim;Yung-Chun (Justin) Wan
Affiliations:
Department of Computer Science, Rutgers University, Camden, NJ 08102, USA;Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA;Department of Computer Science, University of Maryland, College Park, MD 20742, USA;Department of Computer Science, University of Maryland, College Park, MD 20742, USA
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 13

A maiden analysis of longest wait first

ACM Transactions on Algorithms (TALG)
Dependent rounding and its applications to approximation algorithms

Journal of the ACM (JACM)
On scheduling vehicle-roadside data access

Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
Improved on-line broadcast scheduling with deadlines

Journal of Scheduling
Online scheduling to minimize the maximum delay factor

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Service Scheduling of Vehicle-Roadside Data Access

Mobile Networks and Applications
An online scalable algorithm for average flow time in broadcast scheduling

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Off-line algorithms for minimizing total flow time in broadcast scheduling

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved on-line broadcast scheduling with deadlines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Online scalable scheduling for the lk-norms of flow time without conservation of work

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Longest wait first for broadcast scheduling [extended abstract]

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
An online scalable algorithm for average flow time in broadcast scheduling

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the following problem. There are n pages which clients can request at any time. The arrival times of requests for pages are known in advance. Several requests for the same page may arrive at different times. There is a server that needs to compute a good broadcast schedule. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. This problem has recently been shown to be NP-hard. For any fixed α, 0