Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

An easy subexponential bound for online ...

Bosek, Bartłomiej...

Free

Share this content

An easy subexponential bound for online chain partitioning by Bosek, Bartłomiej ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	06-09-2023
Summary	Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width $w$ into $w^{14\lg w}$ chains. We improve this to $w^{6.5 \lg w + 7}$ with a simpler and shorter proof by combining the work of Bosek & Krawczyk with work of Kierstead & Smith on First-Fit chain partitioning of ladder-free posets. We also provide examples illustrating the limits of our approach.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1410.3247

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Bosek, Bartłomiej. An easy subexponential bound for online chain partitioning. Australian National University. September 06, 2023. Accessed November 12, 2024. https://online.provdatabase.com/cite/23693

APA 7th EditionReferences

Bosek, Bartłomiej. (2023). An easy subexponential bound for online chain partitioning. Australian National University. https://online.provdatabase.com/cite/23693

Chicago 17th EditionReferences

Bosek, Bartłomiej. An easy subexponential bound for online chain partitioning. Australian National University. 2023. https://online.provdatabase.com/cite/23693

HarvardReferences

Bosek, Bartłomiej. (2023). An easy subexponential bound for online chain partitioning. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/23693. (Accessed 12 November 2024).

Harvard AustraliaReferences

Bosek, Bartłomiej, 2023, An easy subexponential bound for online chain partitioning, Australian National University, viewed 12 November 2024, <https://online.provdatabase.com/cite/23693>

MLA 9th EditionWorks Cited

Bosek, Bartłomiej. An easy subexponential bound for online chain partitioning. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/23693.

Share this eBook