Bounded Tree-Width and CSP-Related Problems

We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theoretic assumption, that this list homomorphism problem is solvable in polynomial time if and only if all structures in C have bounded tree-width. The result is extended to the connected list homomorphism, edge list homomorphism, minimum cost homomorphism and maximum solution problems. We also show an inapproximability result for the minimum cost homomorphism problem.

[1]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[2]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[3]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[4]  Pavol Hell,et al.  Algorithmic aspects of graph homomorphisms , 2003 .

[5]  Pavol Hell,et al.  Full Constraint Satisfaction Problems , 2006, SIAM J. Comput..

[6]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[7]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[8]  Leo G. Kroon,et al.  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.

[9]  P. Hell,et al.  Sparse pseudo-random graphs are Hamiltonian , 2003 .

[10]  Pavol Hell,et al.  List homomorphisms of graphs with bounded degrees , 2007, Discret. Math..

[11]  Gregory Gutin,et al.  Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs , 2005, AAIM.

[12]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[13]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[14]  Arie M. C. A. Koster,et al.  Branch and Tree Decomposition Techniques for Discrete Optimization , 2005 .

[15]  Pavol Hell,et al.  List Homomorphisms to Reflexive Graphs , 1998, J. Comb. Theory, Ser. B.

[16]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[17]  Jaroslav Nesetril,et al.  Counting List Homomorphisms and Graphs with Bounded Degrees , 2001, Graphs, Morphisms and Statistical Physics.

[18]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[19]  Gustav Nordh,et al.  Generalised Integer Programming Based on Logically Defined Relations , 2006, MFCS.

[20]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[21]  Peter Jonsson,et al.  The complexity of counting homomorphisms seen from the other side , 2004, Theor. Comput. Sci..

[22]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[23]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[24]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[25]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..