On-line chain partitioning as a model for real-time scheduling

MaRDI QIDQ2851690zbMATH OpenFDO

Authors Przemyslaw Broniek

Publication date 2 October 2013

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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics of partially ordered sets (06A07)

Recommendations

• On-line chain partitioning of up-growing interval orders
• Improved lower bound on the on-line chain partitioning of semi-orders with representation
• On-line chain partitions of orders
• Variants of online chain partition problem of posets
• On-line chain partitions of orders: a survey

Cited in

(3)

• A subexponential upper bound for the on-line chain partitioning problem
• On-line chain partitions of orders: a survey
• scientific article; zbMATH DE number 4137540 (Why is no real title available?)

This page was built for publication: On-line chain partitioning as a model for real-time scheduling

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