The following pages link to (Q4411411):
Displaying 13 items.
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← 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)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
- Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
