scientific article; zbMATH DE number 1985300
From MaRDI portal
Publication:4429164
zbMath1034.68041MaRDI QIDQ4429164
Ding-Zhu Du, Xiaoyan Cheng, Mihaela Cardei, Xiuzhen Cheng
Publication date: 24 September 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations ⋮ On the number of rectangulations of a planar point set