37 search results - page 3 / 8 » The Hardness of 3 - Uniform Hypergraph Coloring |
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
The aim of color constancy is to remove the effect of the
color of the light source. As color constancy is inherently
an ill-posed problem, most of the existing color constancy
...
DM
2008
13 years 5 months ago
2008
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin.,...
MFCS
2005
Springer
13 years 11 months 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 6 days 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 ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...