Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2016.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2556960737
@@ Property / OpenAlex ID: W2556960737 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and parameterized algorithms for \textsc{Max 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 @@
+Minimum leaf out-branching and related problems
@@ Property / cites work: Minimum leaf out-branching and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized linear-time algorithm to find minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Better approximation algorithms for the maximum internal spanning tree problem
+Normal rank
@@ Property / cites work @@
+A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+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 @@
+Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+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 @@
+Q2861557
@@ Property / cites work: Q2861557 / rank @@
+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
@@ Property / cites work @@
+Algorithms -- ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8--10, 2014. Proceedings
+Normal rank
@@ Property / cites work @@
+Representative Families: A Unified Tradeoff-Based Approach
+Normal rank