Approximating Acyclicity Parameters of Sparse Hypergraphs

The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx in SODA'06, who introduced the fractional hypertree width of a hypergraph. All these width parameters on hypergraphs are useful for extending tractability of many problems in database theory and artificial intelligence. Computing each of these width parameters is known to be an NP-hard problem. Moreover, the (generalized) hypertree width of an n-vertex hypergraph cannot be approximated within a logarithmic factor unless P=NP. In this paper, we study the approximability of (generalized, fractional) hyper treewidth of sparse hypergraphs where the criterion of sparsity reflects the sparsity of their incidence graphs. Our first step is to prove that the (generalized, fractional) hypertree width of a hypergraph is constant-factor sandwiched by the treewidth of its incidence graph, when the incidence graph belongs to some apex-minor-free graph class (the family of apex-minor-free graph classes includes planar graphs and graphs of bounded genus). This determines the combinatorial borderline above which the notion of (generalized, fractional) hypertree width becomes essentially more general than treewidth, justifying that way its functionality as a hypergraph acyclicity measure. While for more general sparse families of hypergraphs treewidth of incidence graphs and all hypertree width parameters may differ arbitrarily, there are sparse families where a constant factor approximation algorithm is possible. In particular, we give a constant factor approximation polynomial time algorithm for (generalized, fractional) hypertree width on hypergraphs whose incidence graphs belong to some H-minor-free graph class. This extends the results of Feige, Hajiaghayi, and Lee from STOC'05 on approximating treewidth of H-minor-free graphs.

[1]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[2]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[3]  Georg Gottlob,et al.  Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..

[4]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

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

[6]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[7]  Erik D. Demaine,et al.  Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , 2005, SODA '05.

[8]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[9]  Erik D. Demaine,et al.  Bidimensional Parameters and Local Treewidth , 2004, SIAM J. Discret. Math..

[10]  Thomas Schwentick,et al.  Generalized hypertree decompositions: np-hardness and tractable variants , 2007, PODS '07.

[11]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 2001, JACM.

[12]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[13]  Martin Grohe,et al.  Constraint solving via fractional edge covers , 2006, SODA 2006.

[14]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs , 2004, SODA '04.

[15]  Georg Gottlob,et al.  Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2001, PODS '01.

[16]  Dániel Marx,et al.  Approximating fractional hypertree width , 2009, TALG.

[17]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 1997, Theor. Comput. Sci..

[18]  Stephan Kreutzer,et al.  Locally Excluding a Minor , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[19]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[20]  GottlobGeorg,et al.  The complexity of acyclic conjunctive queries , 2001 .

[21]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[22]  Carsten Thomassen.  A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces , 1997, J. Comb. Theory, Ser. B.

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

[24]  Bojan Mohar,et al.  Combinatorial Local Planarity and the Width of Graph Embeddings , 1992, Canadian Journal of Mathematics.

[25]  Georg Gottlob,et al.  Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width , 2003, J. Comput. Syst. Sci..

[26]  James F. Geelen,et al.  Embedding grids in surfaces , 2004, Eur. J. Comb..

[27]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[28]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[29]  Dániel Marx,et al.  Constraint solving via fractional edge covers , 2006, SODA '06.

[30]  Georg Gottlob,et al.  Hypertree Decompositions: Structure, Algorithms, and Applications , 2005, WG.

[31]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[32]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.