The following pages link to (Q4234132):
Displaying 16 items.
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- 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)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← 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)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem (Q4636516) (← links)
- Additive Approximation for Bounded Degree Survivable Network Design (Q5408765) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
