The following pages link to (Q4234132):
Displayed 8 items.
- Minimizing symmetric submodular functions (Q1290631) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)