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

12/02/2022
by   Adil Erzin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2020

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...
research
10/10/2012

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...
research
11/17/2022

(Re)packing Equal Disks into Rectangle

The problem of packing of equal disks (or circles) into a rectangle is a...
research
07/05/2017

Placing your Coins on a Shelf

We consider the problem of packing a family of disks "on a shelf", that ...
research
09/19/2023

Learning based 2D Irregular Shape Packing

2D irregular shape packing is a necessary step to arrange UV patches of ...
research
10/29/2018

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

We consider several extensions of the fractional bin packing problem, a ...
research
07/21/2023

Solving Pallet loading Problem with Real-World Constraints

Efficient cargo packing and transport unit stacking play a vital role in...

Please sign up or login with your details

Forgot password? Click here to reset