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

(54)

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

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)