Approximating acyclicity parameters of sparse hypergraphs

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 445-456

  Fomin, Fedor V ^a   Golovach, Petr A ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Graph; Hypergraph; Hypertree width; Treewidth

Indexed keywords

CONSTANT FACTOR APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; FRACTIONAL HYPERTREE WIDTHS; GENERALIZED HYPERTREE WIDTHS; GRAPH; HYPERGRAPH; HYPERTREE WIDTH; TREE-WIDTH;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 79551509519     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. I. Adler, G. Gottlob, and M. Grohe, Hypertree width and related hypergraph invariants, European J. Combin., 28 (2007), pp. 2167-2181.
2. A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational data bases, in STOC'77, ACM, 1977, pp. 77-90.
3. C. Chekuri and A. Rajaraman, Conjunctive query containment revisited, Theoret. Comput. Sci., 239 (2000), pp. 211-229.
4. A. Dawar, M. Grohe, and S. Kreutzer, Locally excluding a minor, in LICS'07, IEEE Computer Society, 2007, pp. 270-279.
5. E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, Bidimensional parameters and local treewidth, SIAM J. Discrete Math., 18 (2004/05), pp. 501-511.
6. -, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005), pp. 866-893.
7. E. D. Demaine and M. Hajiaghayi, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, in SODA'05, ACM, 2005, pp. 682-689.
8. E. D. Demaine, M. T. Hajiaghayi, and K. ichi Kawarabayashi, Algorithmic graph minor theory: Decomposition, approximation, and coloring, in FOCS'05, IEEE Computer Society, 2005, pp. 637-646.
9. U. Feige, M. Hajiaghayi, and J. R. Lee, Improved approximation algorithms for minimum weight vertex separators, SIAM J. Computing, 38 (2008), pp. 629-657.
10. F. V. Fomin, P. A. Golovach, and D. M. Thilikos, Approximating acyclicity parameters of sparse hypergraphs, CoRR, abs/0809.3646 (2008).
11. J. F. Geelen, R. B. Richter, and G. Salazar, Embedding grids in surfaces, European J. Combin., 25 (2004), pp. 785-792.
12. G. Gottlob, M. Grohe, N. Musliu, M. Samer, and F. Scarcello, Hypertree decompositions: Structure, algorithms, and applications, in WG'05, vol. 3787 of Lecture Notes in Computer Science, Springer, 2005, pp. 1-15.
13. G. Gottlob, N. Leone, and F. Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, 124 (2000), pp. 243-282.
14. -, The complexity of acyclic conjunctive queries, J. ACM, 48 (2001), pp. 431-498.
15. -, Hypertree decompositions and tractable queries, J. Comput. System Sci., 64 (2002), pp. 579-627.
16. -, Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width, J. Comput. System Sci., 66 (2003), pp. 775-808.
17. G. Gottlob, Z. Miklós, and T. Schwentick, Generalized hypertree decompositions: NP-hardness and tractable variants, in PODS'07, ACM, 2007, pp. 13-22.
18. M. Grohe and D. Marx, Constraint solving via fractional edge covers, in SODA'06, ACM, 2006, pp. 289-298.
19. P. G. Kolaitis and M. Y. Vardi, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci., 61 (2000), pp. 302-332.
20. B. Mohar, Combinatorial local planarity and the width of graph embeddings, Canad. J. Math., 44 (1992), pp. 1272-1288.
21. N. Robertson, P. Seymour, and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
22. N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
23. -, Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B, 89 (2003), pp. 43-76.
24. C. Thomassen, A simpler proof of the excluded minor theorem for higher surfaces, J. Combin. Theory Ser. B, 70 (1997), pp. 306-311.
25. M. Yannakakis, Algorithms for acyclic database schemes, in VLDB'81, IEEE Computer Society, 1981, pp. 82-94.