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

Adil I. Erzin Alexander Kononov Georgii Melidi Stepan Nazarenko

Published in: CoRR (2022)

Keyphrases

packing problem
bin packing
integer programming
arbitrary shaped
dc programming
approximation algorithms
error bounds
mixed integer linear program
closed form
big data
approximation error
multiscale
pattern recognition
np hard
traveling salesman problem
higher dimensional