Tight Bounds for Restricted Grid Scheduling (Q5384122): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.7325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on grid processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variable-sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online variable-sized bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on online bin packing with two item sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for on-line bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new version of on-line variable-sized bin packing / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2805215296 / rank
 
Normal rank

Latest revision as of 09:22, 30 July 2024

scientific article; zbMATH DE number 7069578
Language Label Description Also known as
English
Tight Bounds for Restricted Grid Scheduling
scientific article; zbMATH DE number 7069578

    Statements

    Tight Bounds for Restricted Grid Scheduling (English)
    0 references
    0 references
    0 references
    21 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    online algorithms
    0 references
    variable-sized bin packing
    0 references
    restricted grid scheduling
    0 references
    0 references
    0 references