Tight bounds for online class-constrained packing
From MaRDI portal
Publication:596145
DOI10.1016/j.tcs.2003.05.006zbMath1067.90144MaRDI QIDQ596145
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.05.006
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90C27: Combinatorial optimization
90B80: Discrete location and assignment
05B40: Combinatorial aspects of packing and covering
Related Items
Selfish bin coloring, The constrained compartmentalized knapsack problem: mathematical models and solution methods, Class constrained bin covering, Class constrained bin packing revisited, Comparing online algorithms for bin packing problems, The class constrained bin packing problem with applications to video-on-demand, A one-dimensional bin packing problem with shelf divisions, A note on dual approximation algorithms for class constrained bin packing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair versus unrestricted bin packing
- Online algorithms. The state of the art
- Design and implementation of scalable continuous media servers
- On-line load balancing
- Polynomial time approximation schemes for class-constrained packing problems
- Multiprocessor scheduling with machine allotment and parallelism constraints
- Approximation algorithms for knapsack problems with cardinality constraints
- Fast algorithms for bin packing
- Cardinality constrained bin-packing problems
- The Accommodating Function: A Generalization of the Competitive Ratio
- New Algorithms for Bin Packing
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- On the Asymptotic Worst Case Behavior of Harmonic Fit
- On two class-constrained versions of the multiple knapsack problem
