A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
Abstract: 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.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function ; volume:7 ; number:1 ; year:2017 ; pages:403-406 ; extent:4
Open engineering ; 7, Heft 1 (2017), 403-406 (gesamt 4)
- Creator
-
Arslanov, Marat
Amirgalieva, Zhazira
Kenshimov, Chingiz
- DOI
-
10.1515/eng-2017-0045
- URN
-
urn:nbn:de:101:1-2412141715267.331675001696
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:34 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Arslanov, Marat
- Amirgalieva, Zhazira
- Kenshimov, Chingiz
Other Objects (12)
Rigorous packing of unit squares into a circle
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Parallel Packing Squares into a Triangle
Mathematical programming formulations for piecewise polynomial functions
Exact smooth piecewise polynomial sequences on Alfeld splits
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Translative covering by unit squares
Orthogonality is superiority in piecewise-polynomial signal segmentation and denoising
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing squares into a rectangle with a relatively small area
A robust AFPTAS for online bin packing with polynomial migration.
Rigorous packing of unit squares into a circle
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Parallel Packing Squares into a Triangle
Mathematical programming formulations for piecewise polynomial functions
Exact smooth piecewise polynomial sequences on Alfeld splits
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Translative covering by unit squares
Orthogonality is superiority in piecewise-polynomial signal segmentation and denoising
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing squares into a rectangle with a relatively small area
A robust AFPTAS for online bin packing with polynomial migration.
Rigorous packing of unit squares into a circle
TRANSLATIVE PACKING TWO SQUARES IN THE UNIT SQUARE
Parallel Packing Squares into a Triangle
Mathematical programming formulations for piecewise polynomial functions
Exact smooth piecewise polynomial sequences on Alfeld splits
Guillotine cutting is asymptotically optimal for packing consecutive squares
Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels
Translative covering by unit squares
Orthogonality is superiority in piecewise-polynomial signal segmentation and denoising
Perfectly Packing a Square by Squares of Nearly Harmonic Sidelength
Packing squares into a rectangle with a relatively small area