An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

Details An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains

2011-11-09

arxiv.org/abs/1111.2370v2

Mathematics

Combinatorics

v2: minor changes

Scientific paper

It is known that the First-Fit algorithm for partitioning a poset P into chains uses relatively few chains when P does not have two incomparable chains each of size k. In particular, if P has width w then Bosek, Krawczyk, and Szczypka (SIAM J. Discrete Math., 23(4):1992--1999, 2010) proved an upper bound of ckw^{2} on the number of chains used by First-Fit for some constant c, while Joret and Milans (Order, 28(3):455--464, 2011) gave one of ck^{2}w. In this paper we prove an upper bound of the form ckw. This is best possible up to the value of c.

Affiliated with

Also associated with

No associations

Rating

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727627