Lower bounds for randomized algorithms for online chain partitioning

DOI10.1016/J.IPL.2012.05.010MaRDI QIDQ456079zbMATH OpenOpenAlexFDO

Authors Claire Mathieu, Olga Ohrimenko

Publication date 23 October 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.05.010

zbMATH Keywords

chain partitiononline chain partitioningposetrandomized algorithms

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Combinatorics in computer science (68R05) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Cites work

• A decomposition theorem for partially ordered sets
• An Effective Version of Dilworth's Theorem
• scientific article; zbMATH DE number 3993569 (Why is no real title available?)
• On-line chain partitions of orders

Cited in

(4)

• An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains
• On-line chain partitioning of up-growing interval orders
• First-Fit Algorithm for the On-Line Chain Partitioning Problem
• Improved lower bound on the on-line chain partitioning of semi-orders with representation

This page was built for publication: Lower bounds for randomized algorithms for online chain partitioning

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