93 search results - page 3 / 19 » Conditional hardness for approximate coloring |
IJCAI
2001
13 years 8 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Color is a powerful attribute that is used to characterize objects for tracking and other surveillance tasks. Since color is dependent on ambient illumination and the imaging equi...
MFCS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...