Pages that link to "Item:Q3304124"
From MaRDI portal
The following pages link to Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124):
Displaying 9 items.
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- (Q5009490) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices (Q5363769) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)