Pages that link to "Item:Q388116"
From MaRDI portal
The following pages link to A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116):
Displaying 17 items.
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- On small-depth tree augmentations (Q2102832) (← 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)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- (Q5111750) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
