A 3/2–approximation for big two-bar charts packing

by   Adil Erzin, et al.

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· OPT+1, where OPT 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.


page 1

page 2

page 3

page 4


An Improved Approximation for Packing Big Two-Bar Charts

Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in...

Two-Bar Charts Packing Problem

We consider a Bar Charts Packing Problem (BCPP), in which it is necessar...

A 4/3· OPT+2/3 approximation for big two-bar charts packing problem

Two-Bar Charts Packing Problem is to pack n two-bar charts (2-BCs) in a ...

On packing time-respecting arborescences

We present a slight generalization of the result of Kamiyama and Kawase ...

A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System

Packing cost accounts for a large part of the e-commerce logistics cost....

Approximation Algorithms for Two-Bar Charts Packing Problem

In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack t...

Please sign up or login with your details

Forgot password? Click here to reset