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
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1607394607
@@ Property / OpenAlex ID: W1607394607 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Approximation schemes for NP-hard geometric optimization problems: a survey
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q5365098
@@ Property / cites work: Q5365098 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q2934724
@@ Property / cites work: Q2934724 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) approximation scheme for Steiner tree in planar graphs
+Normal rank
@@ Property / cites work @@
+Q2934586
@@ Property / cites work: Q2934586 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Steiner Tree Algorithms for Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction decomposition in h-minor-free graphs and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q2934606
@@ Property / cites work: Q2934606 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471349
@@ Property / cites work: Q4471349 / rank @@
+Normal rank
@@ Property / cites work @@
+Maintenance of a minimum spanning forest in a dynamic plane graph
+Normal rank
@@ Property / cites work @@
+Q2921775
@@ Property / cites work: Q2921775 / rank @@
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+Faster shortest-path algorithms for planar graphs
@@ Property / cites work: Faster shortest-path algorithms for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A subset spanner for Planar graphs, with application to subset TSP
+Normal rank
@@ Property / cites work @@
+A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
+Normal rank
@@ Property / cites work @@
+A faster approximation algorithm for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
+Normal rank
@@ Property / cites work @@
+Dealing with large hidden constants
@@ Property / cites work: Dealing with large hidden constants / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:476424