## A subexponential upper bound for the on-line chain partitioning problem

- Bartlomiej Bosek, Tomasz Krawczyk
- Combinatorica
- 2015

On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5 w −1 4 chains to cover poset of width w. Felsner [3] introduced a variant of this problem considering only up-growing posets, i.e. on-line posets in which each new point is maximal at the moment of its arrival. He presented an… (More)