Bounds for online bin packing with cardinality constraints (Q2629856): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: New lower bounds for certain classes of bin packing algorithms / 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: On the absolute approximation ratio for first fit and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for ordered vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bin Packing with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class constrained bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the online bin packing problem with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constrained bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / 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: On the online bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for class-constrained packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online class-constrained packing / 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: The class constrained bin packing problem with applications to video-on-demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank

Latest revision as of 06:28, 12 July 2024

scientific article
Language Label Description Also known as
English
Bounds for online bin packing with cardinality constraints
scientific article

    Statements

    Bounds for online bin packing with cardinality constraints (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2016
    0 references
    0 references

    Identifiers