Combining Tree Partitioning, Precedence, and Incomparability Constraints

Authors:
Nicolas Beldiceanu;Pierre Flener;Xavier Lorca
Affiliations:
École des Mines de Nantes, LINA FREE CNRS 2729, Nantes Cedex 3, France 44307;Department of Information Technology, and The Linnaeus Centre for Bioinformatics, Uppsala University, Uppsala, Sweden 751 05;École des Mines de Nantes, LINA FREE CNRS 2729, Nantes Cedex 3, France 44307
Venue:
Constraints
Year:
2008

Citing 11
Cited 3

A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Reconstruction of rooted trees from subtrees

Discrete Applied Mathematics
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Robust and Parallel Solving of a Network Design Problem

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A new algorithm for normal dominance constraints

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Determining the consistency of partial tree descriptions

Artificial Intelligence
Necessary Condition for Path Partitioning Constraints

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The tree constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Expected-Case analysis for delayed filtering

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Lazy Composition of Representations in Java

SC '09 Proceedings of the 8th International Conference on Software Composition
The ultrametric constraint and its application to phylogenetics

Journal of Artificial Intelligence Research
Explaining circuit propagation

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requirements on tree count, node degrees, or precedences and incomparabilities within node subsets. We present a generalisation of the tree constraint that incorporates such side constraints. The key point of our approach is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints, in order to avoid thrashing during search. We describe filtering rules for this extended tree constraint and evaluate its effectiveness on three applications: the Hamiltonian path problem, the ordered disjoint paths problem, and the phylogenetic supertree problem.