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.
Saved in:
Published in: | Open Engineering (Warsaw) 2017-12, Vol.7 (1), p.403-406 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | eng |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 2391-5439 2391-5439 |