Improved Steiner tree algorithms for bounded treewidth (Q1932355): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+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 @@
+Q3003675
@@ Property / cites work: Q3003675 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially solvable special cases of the Steiner problem in planar networks
+Normal rank
@@ Property / cites work @@
+Linear-time computation of optimal subgraphs of decomposable graphs
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth: Structure and Algorithms
@@ Property / cites work: Treewidth: Structure and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934724
@@ Property / cites work: Q2934724 / rank @@
+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 @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+The Steiner forest problem revisited
@@ Property / cites work: The Steiner forest problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Practical Partitioning-Based Methods for the Steiner Problem
+Normal rank
@@ Property / cites work @@
+Q3128917
@@ Property / cites work: Q3128917 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3875932
@@ Property / cites work: Q3875932 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Q3663321
@@ Property / cites work: Q3663321 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank