A subexponential upper bound for the on-line chain partitioning problem

Tytuł:
A subexponential upper bound for the on-line chain partitioning problem
Czasopismo:
Combinatorica
Rok:
2015

Strony:
1-38

Tom (seria wydawnicza):
35

Numer DOI:
10.1007/s00493-014-2908-7

Link:
https://dx.doi.org/10.1007/s00493-014-2908-7

Mathscinet link:
https://www.ams.org/mathscinet-getitem?mr=3341138

DBLP link:
https://dblp.org/rec/journals/combinatorica/BosekK15

Access:
ZAMKNIĘTY