2000 character limit reached
An easy subexponential bound for online chain partitioning (1410.3247v2)
Published 13 Oct 2014 in cs.DS and math.CO
Abstract: Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width $w$ into $w{14\lg w}$ chains. We improve this to $w{6.5 \lg w + 7}$ with a simpler and shorter proof by combining the work of Bosek & Krawczyk with work of Kierstead & Smith on First-Fit chain partitioning of ladder-free posets. We also provide examples illustrating the limits of our approach.