Towards a characterization of constant-factor approximable finite-valued CSPs.

Víctor Dalmau Andrei A. Krokhin Rajsekar Manokaran

Published in: J. Comput. Syst. Sci. (2018)

Keyphrases

constant factor
approximation algorithms
constraint satisfaction problems
lower bound
worst case
upper bound
constraint satisfaction
np hard
arc consistency
search space
semi supervised
search algorithm
training data
feature selection
constraint programming
objective function
sample complexity