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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q286991 / rank
Normal rank
 
Property / author
 
Property / author: Maria Grazia Speranza / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590694 / rank
 
Normal rank
Property / zbMATH Keywords
 
bin packing
Property / zbMATH Keywords: bin packing / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case performance
Property / zbMATH Keywords: worst-case performance / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 00:55, 5 March 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