Pages that link to "Item:Q1932355"
From MaRDI portal
The following pages link to Improved Steiner tree algorithms for bounded treewidth (Q1932355):
Displayed 9 items.
- Computing directed Steiner path covers (Q2125222) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- P versus NPC: minimum Steiner trees in convex split graphs (Q6102270) (← links)