The following pages link to (Q4707782):
Displaying 17 items.
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- (Q5874465) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
