A subexponential upper bound for the on-line chain partitioning problem
Crossref DOI link: https://doi.org/10.1007/s00493-014-2908-7
Published Online: 2014-09-10
Published Print: 2015-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bosek, Bartłomiej
Krawczyk, Tomasz
Text and Data Mining valid from 2014-09-10