Approximability of Edge Matching Puzzles
From MaRDI portal
Publication:3401089
DOI10.1007/978-3-642-11266-9_13zbMath1274.68135OpenAlexW1734346956MaRDI QIDQ3401089
Antonios Foivos Antoniadis, Andrzej Lingas
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_13
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40)
Related Items (3)
A guide-and-observe hyper-heuristic approach to the Eternity II puzzle ⋮ A guide-and-observe hyper-heuristic approach to the Eternity II puzzle ⋮ Edge-Matching Problems with Rotations
This page was built for publication: Approximability of Edge Matching Puzzles
