Approximating fractional hypertree width

ACM Transactions on Algorithms

Volumn 6, Issue 2, 2010, Pages

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Constraint satisfaction; Fractional hypertree width; Treewidth

Indexed keywords

CONJUNCTIVE QUERIES; CONJUNCTIVE-QUERY CONTAINMENT; CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION PROBLEMS; DATA BASE THEORY; HYPERGRAPH; HYPERTREE DECOMPOSITION; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH;

COMPUTER OPERATING PROCEDURES; GRAPH THEORY; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES;

CONSTRAINT THEORY;

EID: 77950818751     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1721837.1721845     Document Type: Article

References (34)

1. ADLER, I., GOTTLOB, G., AND GROHE, M. 2007. Hypertree width and related hypergraph invariants. Euro. J. Combin. 28, 8, 2167-2181.
2. BODLAENDER, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305-1317.
3. BODLAENDER,H. L.,GILBERT, J. R.,HAFSTEINSSON, H., ANDKLOKS, T. 1995. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algor. 18, 2, 238-255.
4. BULATOV, A. A. 2002. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 43th Symposium on Foundations of Computer Science. IEEE, 649-658.
5. BULATOV, A. A. 2003. Tractable conservative constraint satisfaction problems. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03). IEEE Computer Society, 321.
6. BULATOV, A. A., KROKHIN, A. A., AND JEAVONS, P. 2001. The complexity of maximal constraint languages. In Proceedings of the 33rd ACM Symposium on Theory of Computing. 667-674.
7. CHEN, H. AND GROHE, M. 2006. Constraint satisfaction problems with succinctly specified relations. Manuscript. Preliminary version in Dagstuhl Seminar Proceedings 06401: Complexity of Constraints.
8. CHUNG, F. R. K., GRAHAM, R. L., FRANKL, P., AND SHEARER, J. B. 1986. Some intersection theorems for ordered sets and graphs. J. Combin. Theory Ser. A 43, 1, 23-37.
9. FEDER, T. ANDVARDI,M.Y. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput. 28, 1, 57-104.
10. FLUM, J. AND GROHE, M. 2006. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin.
11. FOMIN, F. V., GOLOVACH, P. A., AND THILIKOS, D. M. 2009. Approximating acyclicity parameters of sparse hypergraphs. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), S. Albers and J.-Y. Marion, Eds, 445-456.
12. FREUDER, E. C. 1990. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the National Conference on Artificial Intelligence (AAAI-90). 4-9.
13. GOLUMBIC, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
14. GOTTLOB, G., GROHE, M., MUSLIU, N., SAMER, M., AND SCARCELLO, F. 2005. Hypertree decompositions: Structure, algorithms, and applications. In Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol.3787. Springer, 1-15.
15. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 579-627.
16. GOTTLOB, G., MIKĹOS, Z., AND SCHWENTICK, T. 2007. Generalized hypertree decompositions: NPhardness and tractable variants. In Proceedings of the 26th ACMSIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS'07). ACM, New York, 13-22.
17. GOTTLOB, G. AND SZEIDER, S. 2008. Fixed-Parameter algorithms for artificial intelligence, constraint satisfaction and database problems. The Comput. J. 51, 3, 303-325.
18. GROHE, M. 2006. The structure of tractable constraint satisfaction problems. In Proceedings of the Symposium on Mathematical Foundations of Computer Science (MFCS'06). 58-72.
19. GROHE,M. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54, 1, 1.
20. GROHE, M. AND MARX, D. 2006. Constraint solving via fractional edge covers. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06). ACM Press, 289-298.
21. GROHE, M., SCHWENTICK, T., AND SEGOUFIN, L. 2001. When is the evaluation of conjunctive queries tractable? In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01). ACM Press, 657-666.
22. JEAVONS, P., COHEN, D. A., AND GYSSENS, M. 1997. Closure properties of constraints. J. ACM 44, 4, 527-548.
23. KOLAITIS, P. G. AND VARDI, M. Y. 2000. Conjunctive-Query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 2, 302-332.
24. LOV́ASZ, L. 1978. Kneser's conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25, 3, 319-324.
25. MARX, D. 2007. Can you beat treewidth? In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). 169-179.
26. MARX, D. 2009. Tractable structures for constraint satisfaction with truth tables. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), S. Albers and J.-Y. Marion, Eds. 649-660.
27. MATOUŠEK, J. 2004. A combinatorial proof of Kneser's conjecture. Combinatorica 24, 1, 163-170.
28. OUM, S. 2005. Approximating rank-width and clique-width quickly. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science. 49-58.
29. OUM, S. AND SEYMOUR, P. 2007. Testing branch-width. J. Combin. Theory Ser. B 97, 3, 385-393.
30. OUM, S.-I. AND SEYMOUR, P. 2006. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96, 4, 514-528.
31. SCHAEFER, T. J. 1978. The complexity of satisfiability problems. In Conference Record of the 10th Annual ACM Symposium on Theory of Computing. ACM, New York, 216-226.
32. TARJAN, R. E. 1985. Decomposition by clique separators. Discr. Math. 55, 2, 221-232.
33. VAZIRANI, V. 2004. Approximation Algorithms. Springer.
34. WHITESIDES, S. H. 1981. An algorithm for finding clique cut-sets. Inf. Process. Lett. 12, 1, 31-32.