Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
From MaRDI portal
Publication:5387633
DOI10.1007/978-3-540-68155-7_19zbMATH Open1142.68523OpenAlexW1861815471MaRDI QIDQ5387633FDOQ5387633
Authors: Jean-Charles Régin 
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_19
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tree Constraint
- Lowest common ancestors in trees and directed acyclic graphs
- On Finding Lowest Common Ancestors in Trees
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- The “Not-Too-Heavy Spanning Tree” Constraint
- Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
Cited In (8)
- The salesman and the tree: the importance of search in CP
- Weighted spanning tree constraint with explanations
- Improved filtering for weighted circuit constraints
- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- The weighted arborescence constraint
- The “Not-Too-Heavy Spanning Tree” Constraint
- Solving the quorumcast routing problem by constraint programming
- Weighted matching as a generic pruning technique applied to optimization constraints
This page was built for publication: Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387633)
