Approximation algorithms for MAX–MIN tiling

DOI10.1016/S0196-6774(03)00015-4MaRDI QIDQ4420422zbMATH OpenFDO

Authors

Publication date 17 August 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-6774(03)00015-4

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Recommendations

• scientific article; zbMATH DE number 2119697
• Automata, Languages and Programming
• Rectangular Tiling in Multidimensional Arrays
• scientific article; zbMATH DE number 1670543
• A New Approximation Algorithm for Multidimensional Rectangle Tiling

Cited in

(10)

• scientific article; zbMATH DE number 2119697 (Why is no real title available?)
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
• scientific article; zbMATH DE number 1945181 (Why is no real title available?)
• The inverse protein folding problem on 2D and 3D lattices
• Approximating points by a piecewise linear function
• Improved approximation algorithms for rectangle tiling and packing.
• New approximation algorithm for RTILE problem.
• Discovery Science
• A PTAS for the square tiling problem
• 4/3 rectangle tiling lower bound

This page was built for publication: Approximation algorithms for MAX–MIN tiling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420422)