157 search results - page 11 / 32 » Online coloring of hypergraphs |
SODA
1992
ACM
15 years 1 months ago
1992
ACM
COMBINATORICS
2000
15 years 7 days ago
2000
TCS
2010
14 years 10 months ago
2010
107
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
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...