Pages that link to "Item:Q276436"

The following pages link to A subexponential upper bound for the on-line chain partitioning problem (Q276436):

Displaying 9 items.

• First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
• On-line chain partitions of orders: a survey (Q766153) (← links)
• On-line chain partitions of orders (Q1392205) (← links)
• An easy subexponential bound for online chain partitioning (Q1753118) (← links)
• On-line chain partitions of up-growing semi-orders (Q1943698) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
• First-Fit Algorithm for the On-Line Chain Partitioning Problem (Q3058541) (← links)
• Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)