Sciweavers

ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 11 months ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger