An asymptotic competitive scheme for online bin packing (Q896124): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: The maximum resource bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line two-dimensional packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio / 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: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing / rank
 
Normal rank

Latest revision as of 05:33, 11 July 2024

scientific article
Language Label Description Also known as
English
An asymptotic competitive scheme for online bin packing
scientific article

    Statements

    An asymptotic competitive scheme for online bin packing (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    0 references
    online algorithms
    0 references
    competitive scheme
    0 references
    bin packing
    0 references
    0 references