Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-008-9206-5
@@ Property / DOI: 10.1007/s10878-008-9206-5 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-008-9206-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2143720330
@@ Property / OpenAlex ID: W2143720330 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating theDomatic Number
@@ Property / cites work: Approximating theDomatic Number / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded 3-dimensional matching is MAX SNP-complete
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Vertex-Connectivity Network Design Problems
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-008-9206-5
@@ Property / DOI: 10.1007/S10878-008-9206-5 / rank @@
+Normal rank