Pages that link to "Item:Q764316"
From MaRDI portal
The following pages link to Approximating fault-tolerant group-Steiner problems (Q764316):
Displaying 6 items.
- On the hardness of full Steiner tree problems (Q491161) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Approximating fault-tolerant group-Steiner problems (Q2920133) (← links)
- (Q5009500) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Improved approximations for relative survivable network design (Q6574948) (← links)