Pages that link to "Item:Q5317602"
From MaRDI portal
The following pages link to Tighter Bounds for Graph Steiner Tree Approximation (Q5317602):
Displaying 6 items.
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)