✦ LIBER ✦

Minimizing the maximum bump cost in linear extensions of a poset

✍ Scribed by Biao Wu, Longcheng Liu, Enyu Yao

Book ID: 120694126
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 424 KB
Volume: 26
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9456-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing the sum cost in linear extens

Minimizing the sum cost in linear extensions of a poset

✍ Longcheng Liu; Biao Wu; Enyu Yao 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 241 KB

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

The Linear Extension Diameter of a Poset

✍ Felsner, Stefan; Reuter, Klaus 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 396 KB

A comparison of algorithms for minimizin

A comparison of algorithms for minimizing bumps in linear extensions of partial orders

✍ William V. Gehrlein; Peter C. Fishburn 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 526 KB

The minimal cost maximum matching of a g

The minimal cost maximum matching of a graph

✍ A. O. De Maio; C. A. Roveda 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 815 KB

On a long cycle in the graph of all line

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains

✍ Grzegorz Stachowiak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 275 KB