Colored bin packing: online algorithms and lower bounds
From MaRDI portal
Publication:1702125
DOI10.1007/s00453-016-0248-2zbMath1386.68227OpenAlexW2555713747MaRDI QIDQ1702125
Leah Epstein, Pavel Veselý, Martin Böhm, Jiří Sgall, György Dósa
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0248-2
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Unnamed Item ⋮ Selfish colorful bin packing games ⋮ Lower bounds for online bin covering-type problems ⋮ More on ordered open end bin packing ⋮ Comparing the costs of any fit algorithms for bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- New lower bounds for certain classes of bin packing algorithms
- Algorithms for on-line bin-packing problems with cardinality constraints
- Online results for black and white bin packing
- Black and White Bin Packing
- Two-Bounded-Space Bin Packing Revisited
- Colorful Bin Packing
- Online Colored Bin Packing
- On the online bin packing problem
- On online bin packing with LIB constraints
- A simple on-line bin-packing algorithm
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints
- Optimal Analysis of Best Fit Bin Packing
- The optimal absolute ratio for online bin packing
- Online Bin Packing with Cardinality Constraints
- Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing
- Bounded space on-line bin packing: Best is better than first
This page was built for publication: Colored bin packing: online algorithms and lower bounds
