Pages that link to "Item:Q582215"

The following pages link to Minimum-weight two-connected spanning networks (Q582215):

Displaying 35 items.

• Survivable network design with shared-protection routing (Q296897) (← links)
• Capacitated \(m\) two-node survivable star problem (Q325452) (← links)
• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
• The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
• Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
• Linear bounds for on-line Steiner problems (Q672394) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• Survivable minimum bottleneck networks (Q904084) (← links)
• On the integrality ratio for tree augmentation (Q1003482) (← links)
• The box-TDI system associated with 2-edge connected spanning subgraphs (Q1003761) (← links)
• Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
• Directed Steiner problems with connectivity constraints (Q1315992) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• On perfectly two-edge connected graphs (Q1363658) (← links)
• On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks (Q1410692) (← links)
• On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
• On two-connected subgraph polytopes (Q1910503) (← links)
• The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
• A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
• On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
• Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
• Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
• Bounding component sizes of two-connected Steiner networks (Q2380015) (← links)
• Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
• Two-connected Steiner networks: structural properties (Q2488236) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• 2-change for k-connected networks (Q2638954) (← links)
• Full complexity analysis of the diameter-constrained reliability (Q2806430) (← links)
• Polyhedral structure of the 4-node network design problem (Q3057114) (← links)
• Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
• Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
• On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)