๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for Packing Squares

โœ Scribed by Marc M. Paulhus

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
357 KB
Volume
82
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis

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_10 6 in the first two problems and 2_10 6 in the third.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for Packing Connectors
An Algorithm for Packing Connectors
โœ J. Keijsper ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 256 KB

Given an undirected graph G=(V, E) and a partition [S, T] of V, an S&T connector is a set of edges F E such that every component of the subgraph (V, F) intersects both S and T. If either S or T is a singleton, then an S&T connector is a spanning subgraph of G. On the other hand, if G is bipartite wi

An approximation algorithm for least med
An approximation algorithm for least median of squares regression
โœ Clark F. Olson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 486 KB

Least median of squares (LMS) regression is a robust method to fit equations to observed data (typically in a linear model). This paper describes an approximation algorithm for LMS regression. The algorithm generates a regression solution with median residual no more than twice the optimal median re