Approximation Algorithms for Graph Augmentation

Recommendations

Approximation algorithms for graph augmentation
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
scientific article; zbMATH DE number 1760036
NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
scientific article; zbMATH DE number 1833404

Cited in

(47)

On small-depth tree augmentations
Path hitting in acyclic graphs
Faster approximation algorithms for weighted triconnectivity augmentation problems
On finding augmenting graphs
scientific article; zbMATH DE number 2081003 (Why is no real title available?)
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
scientific article; zbMATH DE number 2079893 (Why is no real title available?)
scientific article; zbMATH DE number 1979495 (Why is no real title available?)
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
scientific article; zbMATH DE number 1760036 (Why is no real title available?)
Better algorithms for minimum weight vertex-connectivity problems
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
Approximation algorithms for graph augmentation
A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
An approximation algorithm for minimum-cost vertex-connectivity problems
Fast distributed approximation for TAP and 2-edge-connectivity
On the tree augmentation problem
Polynomial time algorithms for 2-edge-connectivity augmentation problems
A genetic approach for the 2‐edge‐connected minimum branch vertices problem
On the cycle augmentation problem: hardness and approximation algorithms
Kernelization and complexity results for connectivity augmentation problems
A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
2-node-connectivity network design
Node connectivity augmentation via iterative randomized rounding
An improved approximation algorithm for the matching augmentation problem
Fast distributed approximation for TAP and 2-edge-connectivity
Evolutionary local search for the edge-biconnectivity augmentation problem
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
scientific article; zbMATH DE number 1833404 (Why is no real title available?)
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
Algorithms and Computation
scientific article; zbMATH DE number 7205039 (Why is no real title available?)
Approximation algorithms for node and element connectivity augmentation problems
A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
scientific article; zbMATH DE number 2119765 (Why is no real title available?)
2-node-connectivity network design
LP-relaxations for tree augmentation
Approximation algorithms for vertex-connectivity augmentation on the cycle
Correlation clustering and two-edge-connected augmentation for planar graphs
Graph-Theoretic Concepts in Computer Science
A simple LP-based approximation algorithm for the matching augmentation problem
Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions

This page was built for publication: Approximation Algorithms for Graph Augmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033765)