The following pages link to (Q5002841):
Displaying 6 items.
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Online and Stochastic Survivable Network Design (Q4910579) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)