SIGN IN
SIGN UP
Broadcast scheduling: Algorithms and complexity
Full Text:
PDF
Buy this Article
Authors:
Jessica Chang
University of Washington, Seattle, WA
Thomas Erlebach
University of Leicester, Leicester, United Kingdom
Renars Gailis
Blue Coat Systems, Santa Clara, CA
Samir Khuller
University of Maryland, College Park, MD
2011 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 90
· Downloads (cumulative): 286
· Citation Count: 0
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 7 Issue 4, September 2011
Article No. 47
ACM
New York, NY
, USA
table of contents
doi>
10.1145/2000807.2000815
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithms
np-completeness
online algorithms
sequencing and scheduling
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder