Affiliation:
1. Institute of information and computation technologies, Almaty, 050010, Pushkin str.125, Kazakhstan
Abstract
AbstractWe 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.
Subject
Electrical and Electronic Engineering,Mechanical Engineering,Aerospace Engineering,General Materials Science,Civil and Structural Engineering,Environmental Engineering
Reference18 articles.
1. An iterative method to calculate the thermal characteristics of the rock mass with inaccurate initial data;Open Engineering,2016
2. A typology of cutting and packing problems;European Journal of Operational Research
3. Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind-Rademacher sums;Discrete and Computational Geometry,2002
4. Approximation of geometric dispersion problems;Algorithmica,2001