Abstract
Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width w into w141gw chains. We improve this to w6.51g 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.
Original language | English (US) |
---|---|
Article number | #P2.28 |
Journal | Electronic Journal of Combinatorics |
Volume | 25 |
Issue number | 2 |
DOIs | |
State | Published - May 25 2018 |
Keywords
- First-fit
- Ladder
- Online chain partition
- Partially ordered set
- Poset
- Regular poset
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics