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

Greedy linear extensions for minimizing bumps

โœ Scribed by Fawzi Al-Thukair; Nejib Zaguia

Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
495 KB
Volume
4
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing bumps in linear extensions of
Minimizing bumps in linear extensions of ordered sets
โœ Peter C. Fishburn; William V. Gehrlein ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 650 KB

A linear extension x,x2xs ... of a partially ordered set (X, <) has a bump whenever xi < xi+l. We examine the problem of determining linear extensions with as few bumps as possible. Heuristic algorithms for approximate bump minimization are considered. AhfS (MOS) subject classifications (1980). Prim

Greedy linear extensions with constraint
Greedy linear extensions with constraints
โœ Ivan Rival; Nejib Zaguia ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 762 KB

Loosely speaking, a greedy linear extension of an ordered set is a linear extension obtained by following the rule: "climb as high as you can". Given an ordered set P and a partial extension P' of P is there a greedy linear extension of P which satisfies all of the inequalities of P'? We consider sp