Software ENgineering 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. 2000 Mathematics Subject Classification: 68W25, 68W4
منابع مشابه
Software ENgineering New bounds for multi-dimensional packing
New upper and lower bounds are presented for a multi-dimensional generalization of bin pa king alled box pa king. Several variants of this problem, in luding bounded spa e box pa king, square pa king, variable sized box pa king and resour e augmented box pa king are also studied. The main results, stated for d = 2, are as follows: A new upper bound of 2.66013 for online box pa king, a new 14=9 ...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملHardness of approximation for orthogonal rectangle packing and covering problems
Bansal and Sviridenko [4] proved that there is no asymptotic PTAS for 2-dimensional Orthogonal Bin Packing (without rotations), unless P = NP. We show that similar approximation hardness results hold for several 2and 3-dimensional rectangle packing and covering problems even if rotations by ninety degrees are allowed. Moreover, for some of these problems we provide explicit lower bounds on asym...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملParticles Size Distribution Effect on 3d Packing of Nanoparticles Into a Bounded Region
In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...
متن کامل