An approximation algorithm for square packing
We consider the problem of packing squares into bins which are unit squares, where the goal is to minimize the number of bins used. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P != NP.
|Software Engineering [SEN]|
|Organisation||Intelligent and autonomous systems|
van Stee, R. (2004). An approximation algorithm for square packing. Software Engineering [SEN]. CWI.