Skip to main content
Conference ProceedingsOPEN ACCESS

Optimal partial tiling of Manhattan polyominoes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5810 LNCS 79-91
DOI: 10.1007/978-3-642-04397-0_8
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bodini, O., & Lumbroso, J. (2009). Optimal partial tiling of Manhattan polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 79–91). https://doi.org/10.1007/978-3-642-04397-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free