2-node-connectivity network design
From MaRDI portal
Publication:6122594
DOI10.1016/j.tcs.2023.114367OpenAlexW4390338655MaRDI QIDQ6122594
Publication date: 1 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114367
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Covering a laminar family by leaf to leaf links
- On the integrality ratio for tree augmentation
- Coverings and structure of crossing families
- Approximation algorithms for connected dominating sets
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- 2-node-connectivity network design
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- Pruning 2-connected graphs
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- On the tree augmentation problem
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation Algorithms for Graph Augmentation
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- Parameterized Algorithms to Preserve Connectivity
- Improved approximation for tree augmentation: saving by rewiring
- Approximating k-Connected m-Dominating Sets
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- Node connectivity augmentation via iterative randomized rounding
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
