Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671): Difference between revisions

@@ Property / cites work @@
+Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
+Normal rank
@@ Property / cites work @@
+A linear vertex kernel for maximum internal spanning tree
+Normal rank
@@ Property / cites work @@
+Sharp separation and applications to exact and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
+Normal rank
@@ Property / cites work @@
+A 2k-vertex Kernel for Maximum Internal Spanning Tree
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
+Normal rank
@@ Property / cites work @@
+Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3369936
@@ Property / cites work: Q3369936 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum internal spanning tree problem
+Normal rank
@@ Property / cites work @@
+On finding spanning trees with few leaves
@@ Property / cites work: On finding spanning trees with few leaves / rank @@
+Normal rank