4/3 rectangle tiling lower bound

DOI10.1016/j.ipl.2024.106523MaRDI QIDQ6663514

Krzysztof Loryś, Grzegorz Głuch

Publication date: 14 January 2025

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
• Planar Formulae and Their Uses
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 4/3 rectangle tiling lower bound