The following pages link to (Q2921762):
Displaying 7 items.
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- The Priority k-Median Problem (Q5458823) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)