Sciweavers

360 search results - page 8 / 72
» The TV-Break Packing Problem
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 7 months ago
Packing multiway cuts in capacitated graphs
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
Siddharth Barman, Shuchi Chawla
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 28 days ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
SIAMJO
2011
13 years 1 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
14 years 1 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
13 years 8 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon