A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
We consider the problem of packing the maximal number of unit squares in a hypograph of a function. A polynomial time algorithm is described to solve this problem for a piecewise linear function.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-12-01
|
| Series: | Open Engineering |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/eng-2017-0045 |