Sciweavers

Share
STACS
2009
Springer

Approximating Acyclicity Parameters of Sparse Hypergraphs

9 years 4 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These notions were further generalized by Grohe and Marx 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. 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 H 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 bo...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where STACS
Authors Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
Comments (0)
books