Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6566335
@@ Property / zbMATH DE Number: 6566335 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connected \(k\)-path vertex cover
@@ Property / zbMATH Keywords: connected \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+weight
@@ Property / zbMATH Keywords: weight / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+girth
@@ Property / zbMATH Keywords: girth / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank

Revision as of 14:40, 27 June 2023