An improved lower bound for on-line bin packing algorithms (Q1199958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q105583525 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Lower Bound for On-Line Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / 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: On-line bin packing in linear time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:53, 17 May 2024

scientific article
Language Label Description Also known as
English
An improved lower bound for on-line bin packing algorithms
scientific article

    Statements

    An improved lower bound for on-line bin packing algorithms (English)
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    on-line algorithm
    0 references
    bin packing
    0 references
    lower bound
    0 references
    0 references