Pages that link to "Item:Q4686669"
From MaRDI portal
The following pages link to An approximation algorithm for the Steiner connectivity problem (Q4686669):
Displaying 8 items.
- A variational approach to the Steiner network problem (Q810521) (← links)
- A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- (Q3137223) (← links)
- A fast algorithm for computing steiner edge connectivity (Q3581294) (← links)
- (Q4027204) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)