Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-017-9786-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2620883502
@@ Property / OpenAlex ID: W2620883502 / rank @@
+Normal rank
@@ Property / cites work @@
+A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs
+Normal rank
@@ Property / cites work @@
+Approximating Rooted Steiner Networks
@@ Property / cites work: Approximating Rooted Steiner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph
+Normal rank
@@ Property / cites work @@
+Q2913818
@@ Property / cites work: Q2913818 / rank @@
+Normal rank
@@ Property / cites work @@
+A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Rooted \(k\)-connections in digraphs
@@ Property / cites work: Rooted \(k\)-connections in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+An application of submodular flows
@@ Property / cites work: An application of submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum cost source location problems with local vertex-connectivity demands
+Normal rank
@@ Property / cites work @@
+Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation
+Normal rank
@@ Property / cites work @@
+Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the optimal vertex-connectivity augmentation
@@ Property / cites work: On the optimal vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Uniform Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs
+Normal rank
@@ Property / cites work @@
+Approximating Source Location and Star Survivable Network Problems
+Normal rank
@@ Property / cites work @@
+Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Inapproximability of survivable networks
@@ Property / cites work: Inapproximability of survivable networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost connectivity problems via uncrossable bifamilies
+Normal rank
@@ Property / cites work @@
+Approximating node-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Approximating subset \(k\)-connectivity problems
@@ Property / cites work: Approximating subset \(k\)-connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost edge-covers of crossing biset-families
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank
@@ Property / cites work @@
+Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
+Normal rank
@@ Property / cites work @@
+Augmenting Undirected Node-Connectivity by One
@@ Property / cites work: Augmenting Undirected Node-Connectivity by One / rank @@
+Normal rank