Bin covering with cardinality constraints
From MaRDI portal
Publication:2446840
DOI10.1016/j.dam.2013.03.020zbMath1286.05026OpenAlexW2002986112MaRDI QIDQ2446840
Csanád Imreh, Asaf Levin, Leah Epstein
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.03.020
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40) Online algorithms; streaming algorithms (68W27)
Related Items
Irreducible bin packing and normality in routing open shop ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Class constrained bin covering ⋮ Lower bounds for online bin covering-type problems
Cites Work
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Online algorithms for a dual version of bin packing
- Bin packing can be solved within 1+epsilon in linear time
- Using fast matrix multiplication to find basic solutions
- On-line and off-line approximation algorithms for vector covering problems
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Algorithms for on-line bin-packing problems with cardinality constraints
- Cardinality constrained bin-packing problems
- AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
- On a dual version of the one-dimensional bin packing problem
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Approximation schemes for ordered vector packing problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Online Bin Packing with Cardinality Constraints
