TY - GEN

T1 - Graph coloring with rejection

AU - Epstein, Leah

AU - Levin, Asaf

AU - Woeginger, Gerhard J.

PY - 2006

Y1 - 2006

N2 - We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex ν is associated with a penalty rejection cost rν. We need to choose a subset of vertices, V′, and to find a proper coloring of the induced subgraph of G over V′. We are interested in both the number of colors used to color the vertices of V′, and in the total rejection cost of all other vertices. The goal is to minimize the sum of these two amounts. In this paper we consider both the online and the offline versions of this problem. In the online version, vertices arrive one at a time, revealing the rejection cost of the current vertex and the set of edges connecting it to previously revealed vertices. We also consider the classical online coloring problem on bounded degree graphs and on (k + 1)-claw free graphs.

AB - We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex ν is associated with a penalty rejection cost rν. We need to choose a subset of vertices, V′, and to find a proper coloring of the induced subgraph of G over V′. We are interested in both the number of colors used to color the vertices of V′, and in the total rejection cost of all other vertices. The goal is to minimize the sum of these two amounts. In this paper we consider both the online and the offline versions of this problem. In the online version, vertices arrive one at a time, revealing the rejection cost of the current vertex and the set of edges connecting it to previously revealed vertices. We also consider the classical online coloring problem on bounded degree graphs and on (k + 1)-claw free graphs.

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

U2 - 10.1007/11841036_34

DO - 10.1007/11841036_34

M3 - Conference contribution

AN - SCOPUS:33750728908

SN - 3540388753

SN - 9783540388753

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 364

EP - 375

BT - Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings

PB - Springer Verlag

T2 - 14th Annual European Symposium on Algorithms, ESA 2006

Y2 - 11 September 2006 through 13 September 2006

ER -