Pages that link to "Item:Q3111665"
From MaRDI portal
The following pages link to Improved Steiner Tree Algorithms for Bounded Treewidth (Q3111665):
Displaying 8 items.
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- (Q2934603) (← links)
- Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph (Q4686678) (← links)