4 citations · 6 across the 5 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2021
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
Arindam Khan, Eklavya Sharma
In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of…
cs.CG2020
Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins
Eklavya Sharma
We explore approximation algorithms for the -dimensional geometric bin packing problem (BP). Caprara (MOR 2008) gave a harmonic-based algorithm for BP having an asymptotic…