50 search results - page 3 / 10 » Improved approximation algorithms for rectangle tiling and p... |
109
click to vote
EOR
2002
15 years 29 days ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
109
click to vote
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
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...
142
click to vote
IPCO
2008
15 years 2 months ago
2008
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...
SODA
2003
ACM
15 years 2 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...