Rectangular Tiling in Multidimensional Arrays
From MaRDI portal
Recommendations
Cited in
(22)- New approximation algorithm for RTILE problem.
- scientific article; zbMATH DE number 1670543 (Why is no real title available?)
- Efficient approximation algorithms for tiling and packing problems with rectangles
- Rotational terraces from rectangular arrays
- On rectangular covering problems
- RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS
- Aspects of a multivariate complexity analysis for rectangle tiling
- Towards a theory of patches
- scientific article; zbMATH DE number 1305473 (Why is no real title available?)
- scientific article; zbMATH DE number 1945181 (Why is no real title available?)
- Approximation algorithms for MAX–MIN tiling
- Efficient array partitioning
- Polyhedron approximation of tile set
- A PTAS for the square tiling problem
- scientific article; zbMATH DE number 2119697 (Why is no real title available?)
- Tilted corners in integer grids
- Optimized color gamuts for tiled displays
- Relations Between Two Common Types of Rectangular Tilings
- A New Approximation Algorithm for Multidimensional Rectangle Tiling
- Discovery Science
- 4/3 rectangle tiling lower bound
- Rectangle tiling binary arrays
This page was built for publication: Rectangular Tiling in Multidimensional Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521524)
