Pages that link to "Item:Q1861569"

The following pages link to An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569):

Displaying 26 items.

• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← 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)
• Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← 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)
• Path-contractions, edge deletions and connectivity preservation (Q1713475) (← 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)
• 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)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• On the tree augmentation problem (Q2659770) (← links)
• Kernelization and complexity results for connectivity augmentation problems (Q3057175) (← links)
• A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
• Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
• (Q5111750) (← 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)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)