An Improved Approximation for Packing Big Two-Bar Charts

We consider the two-bar charts packing problem which is a generalization of strongly NP-hard bin and 2-D vector problem. propose an O(n2.5)-time 16/11-approximation algorithm for when at least one bar each chart has height more than 1/2 5/4-approximation nonincreasing or nondecreasing higher 1/2.