The minimum spanning tree constraint

Authors:
Grégoire Dooms;Irit Katriel
Affiliations:
Department of Computing Science and Engineering, Université catholique de Louvain, Belgium;BRICS, University of Aarhus, Denmark
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 10
Cited 4

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees

Journal of the ACM (JACM)
Setting Parameters by Example

SIAM Journal on Computing
Finding the k Smallest Spanning Trees

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
A Simpler Minimum Spanning Tree Verification Algorithm

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A 3-approximation for the minimum tree spanning k vertices

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Finding dominators revisited: extended abstract

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
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
Undirected forest constraints

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

The "Not-Too-Heavy Spanning Tree" Constraint

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining Two Structured Domains for Modeling Various Graph Matching Problems

Recent Advances in Constraints
Improved filtering for weighted circuit constraints

Constraints
Solving the quorumcast routing problem by constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces the MST(G,T,W) constraint, which is specified on two graph variables G and T and a vector W of scalar variables. The constraint is satisfied if T is a minimum spanning tree of G, where the edge weights are specified by the entries of W. We develop algorithms that filter the domains of all variables to bound consistency.