Online bin packing with cardinality constraints resolved
From MaRDI portal
Publication:5111695
DOI10.4230/LIPICS.ESA.2017.10zbMATH Open1442.68268MaRDI QIDQ5111695FDOQ5111695
Authors: János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin 
Publication date: 27 May 2020
Recommendations
- Online bin packing with cardinality constraints resolved
- Bounds for online bin packing with cardinality constraints
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Algorithms – ESA 2005
- Improved lower bounds for the online bin packing problem with cardinality constraints
Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Cardinality constrained bin-packing problems
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New lower bounds for certain classes of bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Algorithms for on-line bin-packing problems with cardinality constraints
- New Algorithms for Bin Packing
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- On-line bin packing in linear time
- Online Bin Packing with Cardinality Constraints
- Resource constrained scheduling as generalized bin packing
- Bounds for online bin packing with cardinality constraints
- Approximation schemes for ordered vector packing problems
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- Title not available (Why is that?)
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Online lower bounds via duality
- Tight bounds for online vector bin packing
- Packing small vectors
Cited In (18)
- Algorithms – ESA 2005
- Several methods of analysis for cardinality constrained bin packing
- Colored bin packing: online algorithms and lower bounds
- Tight bounds for online class-constrained packing
- Title not available (Why is that?)
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Title not available (Why is that?)
- Online Bin Packing with Cardinality Constraints
- Lower bounds for several online variants of bin packing
- Cardinality constrained bin-packing problems
- Online bin packing with cardinality constraints resolved
- Online bin packing with arbitrary release times
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Lower bounds for online bin covering-type problems
- A lower bound for online rectangle packing
- Bounds for online bin packing with cardinality constraints
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
This page was built for publication: Online bin packing with cardinality constraints resolved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111695)
