Research map / Learning theory and algorithms / Combinatorial and search optimization
Steiner Tree Problems with Side Constraints Using Constraint Programming
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add the tree propagator with explanations (ablation) | Chuffed STP model · Pure STP, B set | geomean time (s): 18000 (11) -> 17.80 (2) | Helped |
| add the tree propagator with explanations (ablation) | Chuffed GoSST model · GoSST, B set | geomean time (s): 330.34(3) -> 50.96 (2) | Helped |
| add the tree propagator with explanations (ablation) | Chuffed TSTP model · TSTP, B set | geomean time (s): 5040.19 (8) -> 1.62 | Helped |
| add LPLB lower bound over no lower bound (ablation) | Chuffed tree propagator · Pure STP, B set | geomean time (s): 17.80 (2) -> 5.17 | Helped |
| add SPLB lower bound over no lower bound (ablation) | Chuffed tree propagator · Pure STP, B set | geomean time (s): 17.80 (2) -> 22.25 (2) | Hurt |
| enable clause learning (explanations) in LPLB (ablation) | Chuffed LPLB · Pure STP, B set | geomean time (s): 6.99 (1) -> 5.17 | Helped |
| enable clause learning (explanations) in LPLB (ablation) | Chuffed LPLB · TSTP, B set | geomean time (s): 2.29 (1) -> 0.30 | Helped |
| enable clause learning (explanations) in LPLB (ablation) | Chuffed LPLB · Pure STP, ES20FST | geomean time (s): 0.47 -> 0.49 | No clear effect |
| run SPLB before LPLB (SP+LPLB) instead of LPLB alone (ablation) | Chuffed tree propagator · Pure STP, B set | geomean time (s): 5.17 -> 7.11 | Hurt |
| use Chuffed with explanations instead of CHOCO3 | STP solver · GoSST, B set | geomean time (s): 14790.80 (10) -> 37.61 (2) | Helped |
Closest papers by meaning
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.84)
- NN-Steiner: A Mixed Neural-Algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem (AAAI 2024 · similarity 0.83)
- Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures (AAAI 2025 · similarity 0.82)
- Encoding Constraints as Binary Constraint Networks Satisfying BTP (AAAI 2024 · similarity 0.81)
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.80)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.