Scheduling broadcasts with deadlines
type: Item
instance of: scholarly article
title: Scheduling broadcasts with deadlines
zbMATH Open document ID: 1071.68015
author: Jaehoon Kim
author: Kyung-Yong Chwa
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 2110954
zbMATH Keywords: Broadcast scheduling
zbMATH Keywords: On-line algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.02.047
OpenAlex ID: W1868304495
cites work: Q4952666
cites work: Q4828963
cites work: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
cites work: Online algorithms. The state of the art
cites work: Q4737543
cites work: Q2753944
cites work: Algorithms - ESA 2003
cites work: Q3128889
cites work: Q2753958
cites work: On-line scheduling of jobs with fixed start and end times
DOI: 10.1016/J.TCS.2004.02.047
Recommended article: Scheduling Broadcasts with Deadlines
Recommended article: Scheduling in broadcast networks
Recommended article: Improved On-Line Broadcast Scheduling with Deadlines
Recommended article: Improved on-line broadcast scheduling with deadlines
Recommended article: ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
Recommended article: A note on on-line broadcast scheduling with deadlines
Recommended article: Algorithms - ESA 2003
Recommended article: Q4952666
Recommended article: Broadcast scheduling
Recommended article: Scheduling broadcasts in wireless networks
description: scientific article; zbMATH DE number 2110954