A 3/2--approximation for big two-bar charts packing
Data Structures and Algorithms
2020-06-19 v1 Discrete Mathematics
Abstract
We consider a Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem (BPP). Earlier, we proposed an -time algorithm that constructs the packing which length at most , where is the minimum length of the packing of 2-BCs. In this paper, we propose an -time 3/2-approximate algorithm when each BC has at least one bar greater than 1/2.
Cite
@article{arxiv.2006.10361,
title = {A 3/2--approximation for big two-bar charts packing},
author = {Adil Erzin and Stepan Nazarenko and Gregory Melidi and Roman Plotnikov},
journal= {arXiv preprint arXiv:2006.10361},
year = {2020}
}