Introduction to algorithms
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Conjunto: constraint propagation over set constraints with finite set domain variables (abstract)
Proceedings of the eleventh international conference on Logic programming
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)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Robust and Parallel Solving of a Network Design Problem
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Minimum Bounded Degree Spanning Trees
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Cardinal: A Finite Sets Constraint Solver
Constraints
Length-lex ordering for set CSPs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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 minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CPAIOR'06 Proceedings of the Third 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
Improving the held and karp approach with constraint programming
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The weighted spanning tree constraint revisited
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
We develop filtering algorithms for the Weight-Bounded Spanning Tree (WBST(G,T,I,W)) constraint, which is defined on undirected graph variables Gand T, a scalar variable Iand a vector of scalar variables W. It specifies that Tis a spanning tree of Gwhose total weight is at most I, where Wis a vector of the edge weights.