An asymptotic fully polynomial time approximation scheme for bin covering.
type: Item
instance of: scholarly article
title: An asymptotic fully polynomial time approximation scheme for bin covering.
zbMATH Open document ID: 1060.68111
DOI: 10.1016/S0304-3975(03)00363-3
author: Klaus Jansen
author: Roberto Solis-Oba
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 2056815
zbMATH Keywords: Asymptotic approximation scheme
zbMATH Keywords: Bin covering
zbMATH Keywords: Linear programming
MaRDI profile type: Publication
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Two simple algorithms for bin covering
cites work: Better approximation algorithms for bin covering
cites work: Coordination Complexity of Parallel Price-Directive Decomposition
description: scientific article; zbMATH DE number 2056815