{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article6591","name":"Approximating Acyclicity Parameters of Sparse Hypergraphs","abstract":"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.","keywords":["Graph","Hypergraph","Hypertree width","Treewidth"],"author":[{"@type":"Person","name":"Fomin, Fedor V.","givenName":"Fedor V.","familyName":"Fomin"},{"@type":"Person","name":"Golovach, Petr A.","givenName":"Petr A.","familyName":"Golovach"},{"@type":"Person","name":"Thilikos, Dimitrios M.","givenName":"Dimitrios M.","familyName":"Thilikos"}],"position":36,"pageStart":445,"pageEnd":456,"dateCreated":"2009-02-19","datePublished":"2009-02-19","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by-nd\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Fomin, Fedor V.","givenName":"Fedor V.","familyName":"Fomin"},{"@type":"Person","name":"Golovach, Petr A.","givenName":"Petr A.","familyName":"Golovach"},{"@type":"Person","name":"Thilikos, Dimitrios M.","givenName":"Dimitrios M.","familyName":"Thilikos"}],"copyrightYear":"2009","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2009.1803","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6206","volumeNumber":3,"name":"26th International Symposium on Theoretical Aspects of Computer Science","dateCreated":"2009-02-19","datePublished":"2009-02-19","editor":[{"@type":"Person","name":"Albers, Susanne","givenName":"Susanne","familyName":"Albers"},{"@type":"Person","name":"Marion, Jean-Yves","givenName":"Jean-Yves","familyName":"Marion"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article6591","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6206"}}}