Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 05C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C22
@@ Property / Mathematics Subject Classification ID: 05C22 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C82
@@ Property / Mathematics Subject Classification ID: 05C82 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6375630
@@ Property / zbMATH DE Number: 6375630 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial-time approximation scheme
@@ Property / zbMATH Keywords: polynomial-time approximation scheme / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded-genus graphs
@@ Property / zbMATH Keywords: bounded-genus graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Steiner tree
@@ Property / zbMATH Keywords: Steiner tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subset TSP
@@ Property / zbMATH Keywords: subset TSP / rank @@
+Normal rank

Revision as of 19:03, 30 June 2023