The following pages link to (Q4952636):
Displaying 9 items.
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- (Q3002765) (← links)
- Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)