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

An improved approximation algorithm for the complementary maximal strip recovery problem

โœ Scribed by Guohui Lin; Randy Goebel; Zhong Li; Lusheng Wang

Book ID
113698496
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
196 KB
Volume
78
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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