scientific article; zbMATH DE number 5762570

MaRDI QIDQ3575997zbMATH OpenFDO

Authors Bartłomiej Bosek, Piotr Micek

Publication date 28 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAF0102/0.html

zbMATH Keywords

orderposeton-line algorithmchain partition

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Partial orders, general (06A06) Combinatorics in computer science (68R05) Applications of game theory (91A80) 2-person games (91A05)

Recommendations

• Variants of online chain partition problem of posets
• Improved lower bounds on the on-line chain partitioning of posets of bounded dimension
• On-line chain partitioning of up-growing interval orders
• Computing on-line the lattice of maximal antichains of posets
• On-line dimension for posets excluding two long incomparable chains
• On-line chain partitions of up-growing semi-orders
• Online and dynamic algorithms for set cover
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
• On-line chain partitions of orders: a survey
• On-line computations of the ideal lattice of posets

Cited in

(1)

• Variants of online chain partition problem of posets

This page was built for publication:

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