Tight bounds for online class-constrained packing (Q596145): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4828923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair versus unrestricted bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing of Temporary Tasks on Identical Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accommodating Function: A Generalization of the Competitive Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for knapsack problems with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of scalable continuous media servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952620 / 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: Q4796167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751378 / 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: On two class-constrained versions of the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling with machine allotment and parallelism constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Worst Case Behavior of Harmonic Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank

Latest revision as of 18:40, 6 June 2024

scientific article
Language Label Description Also known as
English
Tight bounds for online class-constrained packing
scientific article

    Statements

    Tight bounds for online class-constrained packing (English)
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    Class-constraints
    0 references
    Bin packing
    0 references
    Multiple knapsack
    0 references
    Temporary assignment
    0 references
    Online algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references