A 13/12 approximation algorithm for bin packing with extendable bins (Q293250): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q286991 / rank
Normal rank
 
Property / author
 
Property / author: Paolo Dell'Olmo / rank
Normal rank
 
Property / author
 
Property / author: Maria Grazia Speranza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:37, 12 July 2024

scientific article
Language Label Description Also known as
English
A 13/12 approximation algorithm for bin packing with extendable bins
scientific article

    Statements

    A 13/12 approximation algorithm for bin packing with extendable bins (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    0 references
    bin packing
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    worst-case performance
    0 references