DeepAI AI Chat
Log In Sign Up

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

by   Adil Erzin, et al.

Two-Bar Charts Packing Problem is to pack n two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. We prove that the problem remains strongly NP-hard even if each 2-BC has at least one bar higher than 1/2. Next we consider the case when the first (or second) bar of each 2-BC is higher than 1/2 and show that the O(n^2)-time greedy algorithm with preliminary lexicographic ordering of 2-BCs constructs a packing of length at most OPT+1, where OPT is optimum. Eventually, this result allowed us to present an O(n^2.5)-time algorithm that constructs a packing of length at most 4/3· OPT+2/3 for the NP-hard case when each 2-BC has at least one bar higher than 1/2.


page 1

page 2

page 3

page 4


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

We consider a Two-Bar Charts Packing Problem (2-BCPP), in which it is ne...

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...

(Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a...

Placing your Coins on a Shelf

We consider the problem of packing a family of disks "on a shelf", that ...

A study on load-balanced variants of the bin packing problem

We consider several extensions of the fractional bin packing problem, a ...

FADO: Floorplan-Aware Directive Optimization for High-Level Synthesis Designs on Multi-Die FPGAs

Multi-die FPGAs are widely adopted to deploy large hardware accelerators...

The Complexity of Packing Edge-Disjoint Paths

We introduce and study the complexity of Path Packing. Given a graph G a...