1. On Lazy Bin Covering and Packing problems
- Author
-
Lin, Mingen, Yang, Yang, and Xu, Jinhui
- Subjects
- *
ALGORITHMS , *COMBINATORIAL packing & covering , *APPROXIMATION theory , *CARDINAL numbers , *HARMONIC analysis (Mathematics) , *MATHEMATICS - Abstract
Abstract: In this paper, we study two interesting variants of the classical bin packing problem, called Lazy Bin Covering (LBC) and Cardinality Constrained Maximum Resource Bin Packing (CCMRBP) problems. For the offline LBC problem, we first prove the approximation ratio of the First-Fit-Decreasing and First-Fit-Increasing algorithms, then present an APTAS. For the online LBC problem, we give a competitive analysis for the algorithms of Next-Fit, Worst-Fit, First-Fit, and a modified HARMONIC algorithm. The CCMRBP problem is a generalization of the Maximum Resource Bin Packing (MRBP) problem Boyar et al. (2006) . For this problem, we prove that its offline version is no harder to approximate than the offline MRBP problem. [Copyright &y& Elsevier]
- Published
- 2010
- Full Text
- View/download PDF