An easy subexponential bound for online chain partitioning
Data Structures and Algorithms
2018-04-17 v2 Combinatorics
Abstract
Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width into chains. We improve this to 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.
Cite
@article{arxiv.1410.3247,
title = {An easy subexponential bound for online chain partitioning},
author = {Bartłomiej Bosek and Hal A. Kierstead and Tomasz Krawczyk and Grzegorz Matecki and Matthew E. Smith},
journal= {arXiv preprint arXiv:1410.3247},
year = {2018}
}
Comments
23 pages, 11 figures