5 citations · 5 across the 1 of their papers we have counts for
3 papers
cs.DS2018
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala +1
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in…
cs.DS2017
Approximating Geometric Knapsack via L-packings
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich +3
We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-align…
cs.DS2012★ 5 cited
On Mimicking Networks Representing Minimum Terminal Cuts
Arindam Khan, Prasad Raghavendra, Prasad Tetali +1
Given a capacitated undirected graph with a set of terminals , a mimicking network is a smaller graph that exactly preserves all the minimum cu…