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