Pages that link to "Item:Q4962787"

The following pages link to A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 (Q4962787):

Displaying 18 items.

• Covering a laminar family by leaf to leaf links (Q987693) (← links)
• LP-relaxations for tree augmentation (Q1706120) (← links)
• Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
• Approximating (unweighted) tree augmentation via lift-and-project. II (Q1709583) (← links)
• A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) (Q1944093) (← links)
• Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
• Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
• 2-node-connectivity network design (Q2117701) (← 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)
• On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
• A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
• On the tree augmentation problem (Q2659770) (← links)
• Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
• An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
• Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
• 2-node-connectivity network design (Q6122594) (← links)
• Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)