Pages that link to "Item:Q1861578"
From MaRDI portal
The following pages link to A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578):
Displaying 4 items.
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- A note on iterated rounding for the survivable network design problem (Q5240415) (← links)