scientific article; zbMATH DE number 1979497

MaRDI QIDQ4425952zbMATH OpenFDO

Authors Roberto Solis-Oba, Klaus Jansen

Publication date 14 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180175.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An asymptotic fully polynomial time approximation scheme for bin covering.
• Better approximation algorithms for bin covering
• Approximation algorithms for generalized and variable-sized bin covering
• Bin covering with cardinality constraints
• Optimal on-line algorithms for variable-sized bin covering

Cited in

(2)

• An asymptotic fully polynomial time approximation scheme for bin covering.
• Two simple algorithms for bin covering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425952)