A 3/2-approximation for big two-bar charts packing (Q2045041): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: Optimal Investment in the Development of Oil and Gas Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-bar charts packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5264737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm for the resource-constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adapting genetic algorithm for project scheduling under resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 71/60 theorem for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\) / 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: A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm / rank
 
Normal rank

Revision as of 09:01, 26 July 2024

scientific article
Language Label Description Also known as
English
A 3/2-approximation for big two-bar charts packing
scientific article

    Statements

    A 3/2-approximation for big two-bar charts packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 August 2021
    0 references
    bar charts
    0 references
    strip packing
    0 references
    approximation
    0 references

    Identifiers