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 O(n 2 )-time algorithm that constructs the packing which length at most 2 • OP T + 1, where OP T is the minimum length of the packing of n 2-BCs. In this paper, we propose an O(n 4 )-time 3/2-approximate algorithm when each BC has at least one bar greater than 1/2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.