The following pages link to (Q5417728):
Displaying 10 items.
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- Two Matching Based Algorithm for Tree Network Design (Q4297157) (← links)
- (Q5009500) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Algorithms and Computation (Q5897941) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Tree embeddings for hop-constrained network design (Q6087007) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
