The Minimum Spanning Tree Constraint

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.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[4]  Xavier Lorca,et al.  The tree Constraint , 2005, CPAIOR.

[5]  David Eppstein,et al.  Finding the k Smallest Spanning Trees , 1990, BIT.

[6]  David Eppstein.  Setting Parameters by Example , 2003, SIAM J. Comput..

[7]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[8]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[9]  Pascal Van Hentenryck,et al.  A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data , 2002, UAI.

[10]  Valerie King.  A Simpler Minimum Spanning Tree Verification Algorithm , 1995, WADS.

[11]  Robert E. Tarjan,et al.  Finding dominators revisited: extended abstract , 2004, SODA '04.

[12]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[13]  Robert E. Tarjan,et al.  Maintaining bridge-connected and biconnected components on-line , 1992, Algorithmica.

[14]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.

[15]  Meinolf Sellmann,et al.  Cost-Based Filtering for Shorter Path Constraints , 2003, CP.

[16]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[17]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[18]  Xavier Lorca,et al.  Undirected forest constraints , 2006, Ann. Oper. Res..

[19]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[20]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.