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

Fibres of width 3 ordered sets

โœ Scribed by Zbigniew Lonc

Publisher
Springer Netherlands
Year
1994
Tongue
English
Weight
617 KB
Volume
11
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing setups in ordered sets of fix
Minimizing setups in ordered sets of fixed width
โœ Charles J. Colbourn; William R. Pulleyblank ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 190 KB

A simply polynomial time algorithm is given for computing the setup number, or jump number, of an ordered set with fixed width. This arises as an interesting application of a polynomial time algorithm for solving a more general weighted problem in precedence constrained scheduling.

Ordered sets with small width and large
Ordered sets with small width and large jump number
โœ Weixuan Li; James H. Schmerl ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 89 KB

The following result is proved in this note: For any positive integers w and t, if an ordered set P has jump number at least (t + 1) w -', then either the width of P is moYe than w, or P has a tower, i.e., a linear sum of pairs of noncomparable elements, of height more than t. AhfS (MOS) subject cla