On Directed Steiner Trees with Multiple Roots (Q3181063): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for spanner problems and directed Steiner forest
+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 @@
+Approximation Algorithms for Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter and Approximation Algorithms: A New Look
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / 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 Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
+Normal rank
@@ Property / cites work @@
+Q4598163
@@ Property / cites work: Q4598163 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming for minimum Steiner trees
@@ Property / cites work: Dynamic programming for minimum Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Arc-Weighted Directed Steiner Problems
+Normal rank
@@ Property / cites work @@
+Steiner's problem in graphs and its implications
@@ Property / cites work: Steiner's problem in graphs and its implications / rank @@
+Normal rank
@@ Property / cites work @@
+Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+Q5654074
@@ Property / cites work: Q5654074 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+On Directed Steiner Trees with Multiple Roots
@@ Property / cites work: On Directed Steiner Trees with Multiple Roots / rank @@
+Normal rank