A 3/2approximation for big twobar charts packing
Abstract
We consider a TwoBar Charts Packing Problem (2BCPP), in which it is necessary to pack twobar charts (2BCs) in a unitheight strip of minimum length. The problem is a generalization of the Bin Packing Problem (BPP). Earlier, we proposed an $O(n^2)$time algorithm that constructs the packing which length at most $2\cdot OPT+1$, where $OPT$ is the minimum length of the packing of $n$ 2BCs. In this paper, we propose an $O(n^4)$time 3/2approximate algorithm when each BC has at least one bar greater than 1/2.
 Publication:

arXiv eprints
 Pub Date:
 June 2020
 arXiv:
 arXiv:2006.10361
 Bibcode:
 2020arXiv200610361E
 Keywords:

 Computer Science  Data Structures and Algorithms;
 Computer Science  Discrete Mathematics