An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering

Authors:
Klaus Jansen;Roberto Solis-Oba
Affiliations:
-;-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 9
Cited 0

Online algorithms for a dual version of bin packing

Discrete Applied Mathematics
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition

Mathematics of Operations Research
Two simple algorithms for bin covering

Acta Cybernetica
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
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
A New Fully Polynomial Approximation Scheme for the Knapsack Problem

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the bin covering problem, given a list L = (a1, ..., an) of items with sizes sL (ai) 驴 (0, 1), the goal is to find a packing of the items into bins such that the number of bins that receive items of total size at least 1 is maximized. This is a dual problem to the classical bin packing problem. In this paper we present the first asymptotic fully polynomial-time approximation scheme (AFPTAS) for the bin covering problem.