Q5009562 (Q5009562): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ESA.2018.5 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal absolute ratio for online bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for certain classes of bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Analysis of Best Fit Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust APTAS for the classical bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Harmonic Lower Bound for Online Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logarithmic Additive Integrality Gap for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust AFPTAS for Online Bin Packing with Polynomial Migration, / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / 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: On-line bin packing in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for harmonic-based bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bin Packing Approximations via Discrepancy Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ESA.2018.5 / rank
 
Normal rank

Latest revision as of 15:36, 30 December 2024

scientific article; zbMATH DE number 7378675
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378675

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    bin packing
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references

    Identifiers