Semi-on-line bin packing: a short overview and a new lower bound (Q301113): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10100-012-0266-3 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10100-012-0266-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063792916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line bin packing: a short overview and a new lower bound / 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: Improved lower bounds for semi-online bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound for the Online Bin Packing Problem with Restricted Repacking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2909025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin packing with restricted repacking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic bin packing of unit fractions items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional on-line bin packing: Algorithms and worst-case analysis / 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: 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: Resource augmented semi-online bounded space 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: On Bin Packing with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repacking helps in bounded space on-line bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Relaxed Online Bin-Packing Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batched bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic bin packing with unit fraction items revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental restriction on fully dynamic maintenance of bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic 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: 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: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for on-line bin packing algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10100-012-0266-3 / rank
 
Normal rank

Latest revision as of 13:50, 9 December 2024

scientific article
Language Label Description Also known as
English
Semi-on-line bin packing: a short overview and a new lower bound
scientific article

    Statements

    Semi-on-line bin packing: a short overview and a new lower bound (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    bin packing
    0 references
    semi-on-line algorithms
    0 references
    asymptotic competitive ratio
    0 references
    lower bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers