Pages that link to "Item:Q4537631"
From MaRDI portal
The following pages link to Approximation algorithms for the covering Steiner problem (Q4537631):
Displaying 17 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Exact solutions for the Steiner path cover problem on special graph classes (Q2050271) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Approximation algorithms for union and intersection covering problems (Q2911608) (← links)
- An FPTAS for the fractional group Steiner tree problem (Q2966477) (← links)
- (Q3002765) (← links)
- Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Algorithms and Computation (Q5712114) (← links)
- Approximations for the Steiner multicycle problem (Q6109004) (← links)