Online scheduling with interval conflicts (Q372978): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-012-9408-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041571304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Selection of Intervals and t-Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online set packing and competitive scheduling of multi-part tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive buffer management with packet dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-012-9408-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:38, 9 December 2024

scientific article
Language Label Description Also known as
English
Online scheduling with interval conflicts
scientific article

    Statements

    Online scheduling with interval conflicts (English)
    0 references
    0 references
    0 references
    21 October 2013
    0 references
    online scheduling
    0 references
    online set packing
    0 references
    interval conflicts
    0 references
    competitive analysis
    0 references
    compound tasks
    0 references
    distributed algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references