An easy subexponential bound for online chain partitioning
Abstract
Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width w into w14 w chains. We improve this to w6.5 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.