4 citations · 6 across the 3 of their papers we have counts for
6 papers
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
We study the generalized multidimensional bin packing problem (GVBP) that generalizes both geometric packing and vector packing. Here, we are given rectangular items where the…
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…
Approximation Algorithms for Generalized Multidimensional Knapsack
Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas
We study a generalization of the knapsack problem with geometric and vector constraints. The input is a set of rectangular items, each with an associated profit and nonnegative…
Analysis of the Harmonic Function Used in Bin-Packing
Eklavya Sharma
The harmonic function was first introduced by Lee and Lee (JACM 1985) for analyzing their online bin-packing algorithm. Subsequently, it has been used to obtain approximation algor…
An Approximation Algorithm for Covering Linear Programs and its Application to Bin-Packing
Eklavya Sharma
We give an -approximation algorithm for solving covering LPs, assuming the presence of a -approximation algorithm for a certain optimization problem. Our algorithm i…
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…