2 citations · 2 across the 2 of their papers we have counts for
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.CC2004★ 2 cited
The approximability of three-valued MAX CSP
Peter Jonsson, Mikael Klasson, Andrei Krokhin
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to a…