106 search results - page 3 / 22 » Almost Square Packing |
105
click to vote
ORL
2006
15 years 4 days ago
2006
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
88
Voted
CP
2008
Springer
15 years 1 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
110
Voted
WADS
2009
Springer
15 years 6 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
75
Voted
INFORMS
2008
14 years 10 months ago
2008
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...