Secluded connectivity problems (Q1679225): Difference between revisions

@@ Property / cites work @@
+Q3002828
@@ Property / cites work: Q3002828 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Structure and Algorithms
@@ Property / cites work: Treewidth: Structure and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Steiner Tree Algorithms for Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating label-cover
@@ Property / cites work: On the hardness of approximating label-cover / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of some minimum label problems
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Secluded Path via Shortest Path
@@ Property / cites work: Secluded Path via Shortest Path / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+On the minimum label spanning tree problem
@@ Property / cites work: On the minimum label spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+The labeled perfect matching in bipartite graphs
@@ Property / cites work: The labeled perfect matching in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Approximation and hardness results for label cut and related problems
+Normal rank