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

An approximation algorithm for square packing

โœ Scribed by Rob van Stee

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
185 KB
Volume
32
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for Packing Squares
An Algorithm for Packing Squares
โœ Marc M. Paulhus ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 357 KB

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.

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

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 improved approximation algorithm for
An improved approximation algorithm for the partial Latin square extension problem
โœ Carla P. Gomes; Rommel G. Regis; David B. Shmoys ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa