The following pages link to (Q3579405):
Displaying 5 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
