First-fit coloring on interval graphs has performance ratio at least 5

Henry Kierstead, David A. Smith, W. T. Trotter

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neighbor. The maximum number of colors used by first-fit on graph G over all vertex orders is denoted χ<inf>FF</inf>(G).The exact value of R:=supGχFF(G)ω(G) over interval graphs G is unknown. Pemmaraju, Raman, and Varadarajan (2004) proved R≤. 10, and this can be improved to 8. Witsenhausen (1976) and Chrobak and Ślusarek (1988) showed R≥. 4, and Ślusarek (1993) improved this to 4.45. We prove R≥. 5.

Original languageEnglish (US)
Pages (from-to)236-254
Number of pages19
JournalEuropean Journal of Combinatorics
Volume51
DOIs
StatePublished - Jan 1 2016

Fingerprint

Interval Graphs
Colouring
Graph Coloring
Raman
Vertex of a graph
Assign
Unknown
Integer
Graph in graph theory
Color

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

First-fit coloring on interval graphs has performance ratio at least 5. / Kierstead, Henry; Smith, David A.; Trotter, W. T.

In: European Journal of Combinatorics, Vol. 51, 01.01.2016, p. 236-254.

Research output: Contribution to journalArticle

@article{2bea7f289fa547d08da8a5794108bade,
title = "First-fit coloring on interval graphs has performance ratio at least 5",
abstract = "First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neighbor. The maximum number of colors used by first-fit on graph G over all vertex orders is denoted χFF(G).The exact value of R:=supGχFF(G)ω(G) over interval graphs G is unknown. Pemmaraju, Raman, and Varadarajan (2004) proved R≤. 10, and this can be improved to 8. Witsenhausen (1976) and Chrobak and Ślusarek (1988) showed R≥. 4, and Ślusarek (1993) improved this to 4.45. We prove R≥. 5.",
author = "Henry Kierstead and Smith, {David A.} and Trotter, {W. T.}",
year = "2016",
month = "1",
day = "1",
doi = "10.1016/j.ejc.2015.05.015",
language = "English (US)",
volume = "51",
pages = "236--254",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - First-fit coloring on interval graphs has performance ratio at least 5

AU - Kierstead, Henry

AU - Smith, David A.

AU - Trotter, W. T.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neighbor. The maximum number of colors used by first-fit on graph G over all vertex orders is denoted χFF(G).The exact value of R:=supGχFF(G)ω(G) over interval graphs G is unknown. Pemmaraju, Raman, and Varadarajan (2004) proved R≤. 10, and this can be improved to 8. Witsenhausen (1976) and Chrobak and Ślusarek (1988) showed R≥. 4, and Ślusarek (1993) improved this to 4.45. We prove R≥. 5.

AB - First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neighbor. The maximum number of colors used by first-fit on graph G over all vertex orders is denoted χFF(G).The exact value of R:=supGχFF(G)ω(G) over interval graphs G is unknown. Pemmaraju, Raman, and Varadarajan (2004) proved R≤. 10, and this can be improved to 8. Witsenhausen (1976) and Chrobak and Ślusarek (1988) showed R≥. 4, and Ślusarek (1993) improved this to 4.45. We prove R≥. 5.

UR - http://www.scopus.com/inward/record.url?scp=84931282033&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84931282033&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2015.05.015

DO - 10.1016/j.ejc.2015.05.015

M3 - Article

AN - SCOPUS:84931282033

VL - 51

SP - 236

EP - 254

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -