102 citations
- University of LiverpoolGB4 papers
- University of RostockDE3 papers
- Queen Mary University of LondonGB2 papers
- The Ohio State UniversityUS2 papers
- Umeå UniversitySE2 papers
- Arak UniversityIR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Durham UniversityGB1 paper
- Heriot-Watt UniversityGB1 paper
- Institute of PhysicsPL1 paper
- Institut Municipal d'Assistència SanitàriaES1 paper
- Laboratoire d'Analyse et d'Architecture des SystèmesFR1 paper
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2008
Approximability Distance in the Space of H-Colourability Problems
Tommy Färnqvist, Peter Jonsson, Johan Thapper
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted Maximum H-Colourabl…
cs.CC2007
Hard constraint satisfaction problems have hard gaps at location 1
Peter Jonsson, Andrei Krokhin, Fredrik Kuivinen
An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constra…