Pages that link to "Item:Q1290632"
From MaRDI portal
The following pages link to An efficient approximation algorithm for the survivable network design problem (Q1290632):
Displaying 22 items.
- A new approach for solving the network problems (Q505104) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A factor 2 approximation algorithm for the generalized Steiner network problem (Q873648) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- On budget-constrained flow improvement. (Q2583570) (← links)
- Complexity of column generation in network design with path-based survivability mechanisms (Q2892152) (← links)
- Network flow spanners (Q3057178) (← 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)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
