Pages that link to "Item:Q689117"
From MaRDI portal
The following pages link to Survivable networks, linear programming relaxations and the parsimonious property (Q689117):
Displayed 19 items.
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- Generalized spanning trees (Q1579496) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location (Q5459999) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- A comparison of Steiner tree relaxations (Q5946825) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)