Sciweavers

Share
16 search results - page 1 / 4
» Improved Absolute Approximation Ratios for Two-Dimensional P...
Sort
View
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
13 years 6 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
13 years 5 months ago
Maximizing the Number of Packed Rectangles
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Klaus Jansen, Guochuan Zhang
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 1 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
AAIM
2008
Springer
116views Algorithms» more  AAIM 2008»
13 years 6 months ago
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang
TAMC
2007
Springer
13 years 5 months ago
Approximation Algorithms for 3D Orthogonal Knapsack
We study non-overlapping axis-parallel packings of 3D boxes with proļ¬ts into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf ...
books