Variants of online chain partition problem of posets

MaRDI QIDQ2851094zbMATH OpenFDO

Authors Bartłomiej Bosek, Piotr Micek

Publication date 2 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105051224

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Online algorithms; streaming algorithms (68W27) Games involving graphs (91A43)

Recommendations

• On-line chain partitioning of up-growing interval orders
• scientific article; zbMATH DE number 5762570
• On-line chain partitions of orders: a survey
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
• Improved lower bound on the on-line chain partitioning of semi-orders with representation

Cited in

(8)

• On-line chain partitions of up-growing semi-orders
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
• On-line chain partitioning of up-growing interval orders
• On-line chain partitioning as a model for real-time scheduling
• Forbidden structures for efficient first-fit chain partitioning (extended abstract)
• First-Fit Algorithm for the On-Line Chain Partitioning Problem
• scientific article; zbMATH DE number 5762570 (Why is no real title available?)
• On-line computations of the ideal lattice of posets

This page was built for publication: Variants of online chain partition problem of posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851094)