Pages that link to "Item:Q4537631"
From MaRDI portal
The following pages link to Approximation algorithms for the covering Steiner problem (Q4537631):
Displayed 6 items.
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← 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)