Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
From MaRDI portal
Publication:5740195
DOI10.1007/978-3-319-34171-2_23zbMath1385.68054MaRDI QIDQ5740195
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_23
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating minimum-cost edge-covers of crossing biset-families
- An approximation algorithm for minimum-cost vertex-connectivity problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Inapproximability of survivable networks
- Rooted \(k\)-connections in digraphs
- An application of submodular flows
- Approximating node connectivity problems via set covers
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
- On the optimal vertex-connectivity augmentation
- Minimal edge-coverings of pairs of sets
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
- Approximating node-connectivity augmentation problems
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
- Augmenting Undirected Node-Connectivity by One
- An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- Improved Approximation Algorithms for Uniform Connectivity Problems
- An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
- Approximating k-node Connected Subgraphs via Critical Graphs
