An asymptotic fully polynomial time approximation scheme for bin covering

Authors:
Klaus Jansen;Roberto Solis-Oba
Affiliations:
Institut für Informatik und Praktische Mathematik, Universität zu Kiel, Germany;Department of Computer Science, University of Western Ontario, London ONT. N6A 5B7, Canada
Venue:
Theoretical Computer Science
Year:
2003

Citing 4
Cited 13

Coordination complexity of parallel price-directive decomposition

Mathematics of Operations Research
Two simple algorithms for bin covering

Acta Cybernetica
Better approximation algorithms for bin covering

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing

Bin packing problems with rejection penalties and their dual problems

Information and Computation
The maximum resource bin packing problem

Theoretical Computer Science
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing

Information Processing Letters
Hardness of approximation for orthogonal rectangle packing and covering problems

Journal of Discrete Algorithms
Bin packing problems with rejection penalties and their dual problems

Information and Computation
On the sum minimization version of the online bin covering problem

Discrete Applied Mathematics
Approximation algorithms for min-max generalization problems

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Selfish bin covering

Theoretical Computer Science
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items

SIAM Journal on Optimization
Bin packing and covering problems with rejection

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The maximum resource bin packing problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An improved approximation scheme for variable-sized bin packing

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Bin covering with cardinality constraints

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the bin covering problem there is a group L = (a1,...,an) of items with sizes s(ai) ∈ (0, 1), and the goal is to find a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the first asymptotic fully polynomial-time approximation scheme for the problem.