scientific article
From MaRDI portal
Publication:2851690
zbMath1272.06005MaRDI QIDQ2851690
Publication date: 2 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105051236
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics of partially ordered sets (06A07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items (2)
A subexponential upper bound for the on-line chain partitioning problem ⋮ On-line chain partitions of orders: a survey
This page was built for publication:
