On-line chain partitions of up-growing semi-orders

DOI10.1007/s11083-011-9228-yzbMath1282.06006OpenAlexW1984477615WikidataQ72990559 ScholiaQ72990559MaRDI QIDQ1943698

Kamil Kloch, Grzegorz Matecki, Piotr Micek, Stefan Felsner

Publication date: 20 March 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-011-9228-y

zbMATH Keywords

dimensionpartially ordered setsemi-orderon-line chain partition

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Combinatorics of partially ordered sets (06A07) Online algorithms; streaming algorithms (68W27)

Related Items

A subexponential upper bound for the on-line chain partitioning problem, On-line chain partitions of orders: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• On-line chain partitions of orders: a survey
• On-line chain partitions of orders
• On-line chain partitioning of up-growing interval orders
• An Effective Version of Dilworth's Theorem