Article

Constraint solving via fractional edge covers

Authors:

Dániel MarxAuthors Info & Claims

SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Pages 289 - 298

Published: 22 January 2006 Publication History

Abstract

Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot of attention. In this paper, we are interested in structural properties that can make the problem tractable. So far, the largest structural class that is known to be polynomial-time solvable is the class of bounded hypertree width instances introduced by Gottlob et al. [20]. Here we identify a new class of polynomial-time solvable instances: those having bounded fractional edge cover number.Combining hypertree width and fractional edge cover number, we then introduce the notion of fractional hypertree width. We prove that constraint satisfaction problems with bounded fractional hypertree width can be solved in polynomial time (provided that a the tree decomposition is given in the input). We also prove that certain parameterized constraint satisfaction, homomorphism, and embedding problems are fixed-parameter tractable on instances having bounded fractional hypertree width.

References

[1]

I. Adler. Marshals, monotone marshals, and hypertree-width. Journal of Graph Theory, 47:275--296, 2004.

Digital Library

[2]

I. Adler, G. Gottlob, and M. Grohe. Hypertree-width and related hypergraph invariants. In Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications, 2005. To appear.

[3]

N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844--856, 1995.

Digital Library

[4]

C. Berge. Graphs and Hypergraphs. North Holland, 1976.

Digital Library

[5]

A. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 649--658, 2002.

Digital Library

[6]

A. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, pages 321--330, 2003.

Digital Library

[7]

A. A. Bulatov, A. A. Krokhin, and P. Jeavons. The complexity of maximal constraint languages. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 667--674, 2001.

Digital Library

[8]

H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, 2005. To appear.

[9]

F. Chung, P. Frank, R. Graham, and J. Shearer. Some intersection theorems for ordered sets and graphs. Journal of Combinatorial Theory, Series A, 43:23--37, 1986.

Digital Library

[10]

D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005. To appear.

Digital Library

[11]

V. Dalmau, Ph. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In P. Van Hentenryck, editor, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, volume 2470 of Lecture Notes in Computer Science, pages 310--326. Springer-Verlag, 2002.

Digital Library

[12]

R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.

Digital Library

[13]

R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353--366, 1989.

Digital Library

[14]

R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3):514--550, 1983.

Digital Library

[15]

T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 28:57--104, 1998.

Digital Library

[16]

E.C Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence, pages 4--9, 1990.

[17]

E. Friedgut and J. Kahn. On the number of copies of a hypergraph in another. Israel Journal of Mathematics, 105:251--256, 1998.

[18]

G. Gottlob, M. Grohe, N. Musliu, M. Samer, and F. Scarcello. Hypertree decompositions: Structure, algorithms, and applications. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, 2005. To appear.

Digital Library

[19]

G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In T. Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 394--399. Morgan Kaufmann, 1999.

Digital Library

[20]

G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64:579--627, 2002.

[21]

G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66:775--808, 2003.

Digital Library

[22]

M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 552--561, 2003.

Digital Library

[23]

M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 657--666, 2001.

Digital Library

[24]

P. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527--548, 1997.

Digital Library

[25]

Ph. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems, pages 205--213, 1998.

Digital Library

[26]

D. Marx. The closest substring problem with small distances. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005. To appear.

Digital Library

[27]

B. Reed. Tree width and tangles: A new connectivity measure and some applications. In R. A. Bailey, editor, Surveys in Combinatorics, volume 241 of LMS Lecture Note Series, pages 87--162. Cambridge University Press, 1997.

[28]

T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216--226, 1978.

Digital Library

[29]

P. D. Seymour and R. Thomas. Graph searching and a minmax theorem for tree-width. Journal of Combinatorial Theory, Series B, 58:22--33, 1993.

Digital Library

[30]

M. Yannakakis. Algorithms for acyclic database schemes. In 7th International Conference on Very Large Data Bases, pages 82--94, 1981.

Cited By

Deeds KSuciu DBalazinska M(2023)SafeBound: A Practical System for Generating Cardinality BoundsProceedings of the ACM on Management of Data10.1145/35889071:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588907
Gottlob GLanzinger MPichler RRazgon I(2021)Complexity Analysis of Generalized and Fractional Hypertree DecompositionsJournal of the ACM10.1145/345737468:5(1-50)Online publication date: 13-Sep-2021
https://dl.acm.org/doi/10.1145/3457374
Olteanu D(2020)The relational data borg is learningProceedings of the VLDB Endowment10.14778/3415478.341557213:12(3502-3515)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3415478.3415572
Show More Cited By

Index Terms

Constraint solving via fractional edge covers
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
    2. Graph theory
      1. Graph algorithms
  2. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
  2. Randomness, geometry and discrete structures

Recommendations

Constraint Solving via Fractional Edge Covers

Many important combinatorial problems can be modeled as constraint satisfaction problems. Hence, identifying polynomial-time solvable classes of constraint satisfaction problems has received a lot of attention. In this article, we are interested in ...
Solving #SAT using vertex covers

We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form. Our algorithm is based on the detection of strong backdoor sets of bounded size; each instantiation of the variables of a strong backdoor set ...
Solving d-SAT via backdoors to small treewidth
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms

A backdoor set of a CNF formula is a set of variables such that fixing the truth values of the variables from this set moves the formula into a polynomial-time decidable class. In this work we obtain several algorithmic results for solving d-SAT, by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

January 2006

1261 pages

ISBN:0898716055

Sponsors

SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 22 January 2006

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
476
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Deeds KSuciu DBalazinska M(2023)SafeBound: A Practical System for Generating Cardinality BoundsProceedings of the ACM on Management of Data10.1145/35889071:1(1-26)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588907
Gottlob GLanzinger MPichler RRazgon I(2021)Complexity Analysis of Generalized and Fractional Hypertree DecompositionsJournal of the ACM10.1145/345737468:5(1-50)Online publication date: 13-Sep-2021
https://dl.acm.org/doi/10.1145/3457374
Olteanu D(2020)The relational data borg is learningProceedings of the VLDB Endowment10.14778/3415478.341557213:12(3502-3515)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3415478.3415572
Yolov NCzumaj A(2018)Minor-matching hypertree widthProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175282(219-233)Online publication date: 7-Jan-2018
https://dl.acm.org/doi/10.5555/3174304.3175282
Ngo HVan den Bussche JArenas M(2018)Worst-Case Optimal Join AlgorithmsProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196990(111-124)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196990
Fischl WGottlob GPichler RVan den Bussche JArenas M(2018)General and Fractional Hypertree DecompositionsProceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3196959.3196962(17-32)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3196959.3196962
Ngo HPorat ERé CRudra A(2018)Worst-case Optimal Join AlgorithmsJournal of the ACM10.1145/318014365:3(1-40)Online publication date: 13-Mar-2018
https://dl.acm.org/doi/10.1145/3180143
Abo Khamis MNgo HSuciu DSallinger EVan den Bussche JGeerts F(2017)What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3056105(429-444)Online publication date: 9-May-2017
https://dl.acm.org/doi/10.1145/3034786.3056105
Koutris PMilo TRoy SSuciu D(2017)Answering Conjunctive Queries with InequalitiesTheory of Computing Systems10.1007/s00224-016-9684-261:1(2-30)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00224-016-9684-2
Khamis MNgo HRé CRudra A(2016)Joins via Geometric ResolutionsACM Transactions on Database Systems10.1145/296710141:4(1-45)Online publication date: 8-Nov-2016
https://dl.acm.org/doi/10.1145/2967101
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents