On-line Chain Partitioning of Up-growing Interval Orders


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)
DOI: 10.1007/s11083-006-9050-0


6 Figures and Tables