An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6477671
@@ Property / zbMATH DE Number: 6477671 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph connectivity
@@ Property / zbMATH Keywords: graph connectivity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network design
@@ Property / zbMATH Keywords: network design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subset \(k\)-connected subgraph
@@ Property / zbMATH Keywords: subset \(k\)-connected subgraph / rank @@
+Normal rank

Revision as of 22:43, 30 June 2023