Effectiveness of Structural Restrictions for Hybrid CSPs

ISAAC 2015

Authors: Vladimir Kolmogorov, Michal Rolinek, Rustem Takhanov

A strange paper in retrospect. Roughly speaking, it says on which classes of graphs (relational structures) one should not expect combinatorial optimization problems to become computationally easier.