Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+Approximating Fault-Tolerant Domination in General Graphs
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for minimum cost node-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost connectivity problems via uncrossable bifamilies
+Normal rank
@@ Property / cites work @@
+Approximating subset \(k\)-connectivity problems
@@ Property / cites work: Approximating subset \(k\)-connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
+Normal rank
@@ Property / cites work @@
+Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Q4860774
@@ Property / cites work: Q4860774 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Q4878669
@@ Property / cites work: Q4878669 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for the vertices of degree k in minimally k‐connected graphs
+Normal rank