Optimal Partial Tiling of Manhattan Polyominoes
classification
💻 cs.DM
cs.DSmath.CO
keywords
tilingalgorithmmanhattanoptimalpartialpolyominoesborrowedcase
read the original abstract
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some techniques are borrowed from traditional graph optimisation problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.