Pages that link to "Item:Q5857009"

The following pages link to Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009):

Displaying 8 items.

• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
• Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices (Q5363769) (← links)
• On the complexity of the cable-trench problem (Q6048437) (← links)
• Lossy kernelization of same-size clustering (Q6174654) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)
• Parameterized algorithms for the Steiner arborescence problem on a hypercube (Q6659999) (← links)