| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428175 | Information Processing Letters | 2008 | 5 Pages |
Abstract
We present a constant factor, polynomial time approximation algorithm for the problem of scheduling a sequence of rectangles on a matrix. The approximation is on the area covered by the rectangles, and a rectangle is placed on the matrix only if all its preceding rectangles in the sequence were already placed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
