Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Dynamic Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / 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: Analysis of a Compound Bin Packing Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / 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: Q4142699 / 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
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00092-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1493845713 / rank
 
Normal rank

Latest revision as of 11:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
scientific article

    Statements

    Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (English)
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    bin packing
    0 references
    computational complexity
    0 references
    0 references