Scheduling broadcasts with deadlines (Q1884847): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1868304495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank

Latest revision as of 13:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Scheduling broadcasts with deadlines
scientific article

    Statements

    Scheduling broadcasts with deadlines (English)
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    Broadcast scheduling
    0 references
    On-line algorithms
    0 references

    Identifiers