On-line Adaptive Chain Covering of Upgrowing Posets - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

On-line Adaptive Chain Covering of Upgrowing Posets


We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into $\frac{{5}^{w-1}}{4}$ chains. Felsner proved that if Spoiler presents an upgrowing poset, i.e., each new point is maximal at the moment of its arrival then there is a strategy for Algorithm using at most $\binom{w+1}{2}$ chains and it is best possible. An adaptive variant of this problem allows Algorithm to assign to the new point a set of chains and than to remove some of them (but not all) while covering next points. Felsner stated a hypothesis that in on-line adaptive chain covering of upgrowing posets Algorithm may use smaller number of chains than in non-adaptive version. In this paper we provide an argument suggesting that it is true. We present a class of upgrowing posets in which Spoiler has a strategy forcing Algorithm to use at least $\binom{w+1}{2}$ chains (in non-adaptive version) and Algorithm has a strategy using at most $O(w\sqrt{w})$ chains in adaptive version.
Fichier principal
Vignette du fichier
dmAF0102.pdf (143.01 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

hal-01183337 , version 1 (11-08-2015)



Bartłomiej Bosek, Piotr Micek. On-line Adaptive Chain Covering of Upgrowing Posets. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. pp.37-48, ⟨10.46298/dmtcs.3473⟩. ⟨hal-01183337⟩
89 View
532 Download



Gmail Mastodon Facebook X LinkedIn More