Document Open Access Logo

On the Exact Complexity of Polyomino Packing

Authors Hans L. Bodlaender, Tom C. van der Zanden

PDF

File

Thumbnail PDF
PDF
LIPIcs.FUN.2018.9.pdf
  • Filesize: 493 kB
  • 10 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
  • Mathematics of computing → Combinatorial algorithms
Keywords
  • polyomino packing
  • exact complexity
  • exponential time hypothesis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We show that the problem of deciding whether a collection of polyominoes, each fitting in a 2 x O(log n) rectangle, can be packed into a 3 x n box does not admit a 2^{o(n/log{n})}-time algorithm, unless the Exponential Time Hypothesis fails. We also give an algorithm that attains this lower bound, solving any instance of polyomino packing with total area n in 2^{O(n/log{n})} time. This establishes a tight bound on the complexity of Polyomino Packing, even in a very restricted case. In contrast, for a 2 x n box, we show that the problem can be solved in strongly subexponential time.

Cite As Get BibTex

Hans L. Bodlaender and Tom C. van der Zanden. On the Exact Complexity of Polyomino Packing. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 9:1-9:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FUN.2018.9

Author Details

Hans L. Bodlaender
  • Department of Computer Science, Utrecht University, Utrecht, The Netherlands and Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Tom C. van der Zanden
  • Department of Computer Science, Utrecht University, Utrecht, The Netherlands

References

  1. Hans L. Bodlaender, Jesper Nederlof, and Tom C. van der Zanden. Subexponential time algorithms for embedding h-minor free graphs. In Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi, editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, volume 55 of LIPIcs, pages 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. URL: http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.9.
  2. Hans L. Bodlaender and Tom C. van der Zanden. Improved Lower Bounds for Graph Embedding Problems. In Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, editors, 10th International Conference on Algorithms and Complexity (CIAC 2017), volume 10236 of LNCS, pages 92-103. Springer, 2017. Google Scholar
  3. Michael Brand. Small polyomino packing. Information Processing Letters, 126:30-34, 2017. Google Scholar
  4. Erik D. Demaine and Martin L. Demaine. Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics, 23(1):195-208, 2007. Google Scholar
  5. Robert A. Hearn and Erik D. Demaine. Games, Puzzles, and Computation. CRC Press, 2009. Google Scholar
  6. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-SAT. Journal of Computer and System Sciences, 62(2):367-375, 2001. Google Scholar
  7. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63:512-530, 2001. Google Scholar
  8. David A. Klarner and Ronald L. Rivest. A procedure for improving the upper bound for the number of n-ominoes. Canad. J. Math, 25(3):585-602, 1973. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact