An algorithm for packing squares

被引：19

作者：

Paulhus, RM ^{[1
]}

机构：

[1] Univ Calgary, Dept Math, Calgary, AB T2N 1N4, Canada

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 1998年 / 82卷 / 02期

关键词：

D O I：

10.1006/jcta.1997.2836

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An algorithm is presented that can be used to pack sets of squares (or rectangles) into rectangles. The algorithm is applied to three open problems and will show how the best known results can be improved by a factor of at least 6 x 10(6) in the first two problems and 2 x 10(6) in the third. (C) 1998 Academic Press, Inc.

引用

页码：147 / 157

页数：11

共 7 条

[1]

BALINT V, IN PRESS DISCRETE MA

[2]

BALINT V, 1992, 4 CZECH S COMB GRAPH, P17

[3] On packing unequal squares [J].