Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: György Dósa / rank
Normal rank
 
Property / author
 
Property / author: György Dósa / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / 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: 6244707 / rank
 
Normal rank
Property / zbMATH Keywords
 
first fit decreasing
Property / zbMATH Keywords: first fit decreasing / rank
 
Normal rank
Property / zbMATH Keywords
 
bin packing
Property / zbMATH Keywords: bin packing / rank
 
Normal rank
Property / zbMATH Keywords
 
tight bound
Property / zbMATH Keywords: tight bound / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W179790402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof for the first-fit decreasing bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter bound for FFd algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the machine scheduling problem with job delivery coordination / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:04, 7 July 2024

scientific article
Language Label Description Also known as
English
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
scientific article

    Statements

    Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    first fit decreasing
    0 references
    bin packing
    0 references
    tight bound
    0 references

    Identifiers