Pages that link to "Item:Q1165162"

The following pages link to On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162):

Displaying 26 items.

• Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874) (← links)
• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
• Covering a laminar family by leaf to leaf links (Q987693) (← links)
• Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
• On perfectly two-edge connected graphs (Q1363658) (← links)
• LP-relaxations for tree augmentation (Q1706120) (← links)
• On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
• On small-depth tree augmentations (Q2102832) (← links)
• Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
• A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
• The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
• Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• Bounding component sizes of two-connected Steiner networks (Q2380015) (← links)
• Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
• Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
• The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
• Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
• Approximation algorithms for graph augmentation (Q5204328) (← links)
• Securely Connected Facility Location in Metric Graphs (Q5232830) (← links)
• Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)
• On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)