A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6691857
@@ Property / zbMATH DE Number: 6691857 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graphs
@@ Property / zbMATH Keywords: graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimization
@@ Property / zbMATH Keywords: optimization / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2274535290
@@ Property / OpenAlex ID: W2274535290 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+Max-leaves spanning tree is APX-hard for cubic graphs
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
+Normal rank
@@ Property / cites work @@
+Improved bounds for spanning trees with many leaves
+Normal rank
@@ Property / cites work @@
+A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+On Finding Directed Trees with Many Leaves
@@ Property / cites work: On Finding Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum leaf spanning arborescence problem
+Normal rank
@@ Property / cites work @@
+The complexity ecology of parameters: An illustration using bounded max leaf number
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+The maximum-leaf spanning tree problem: Formulations and facets
+Normal rank
@@ Property / cites work @@
+A short note on the approximability of the maximum leaves spanning tree problem
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves in cubic graphs
@@ Property / cites work: Spanning trees with many leaves in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees in graphs of minimum degree 4 or 5
@@ Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
+Normal rank
@@ Property / cites work @@
+A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411401
@@ Property / cites work: Q4411401 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Leaf Spanning Trees in Almost Linear Time
+Normal rank
@@ Property / cites work @@
+Arbres avec un nombre maximum de sommets pendants
@@ Property / cites work: Arbres avec un nombre maximum de sommets pendants / rank @@
+Normal rank
@@ Property / cites work @@
+An Amortized Search Tree Analysis for k-Leaf Spanning Tree
+Normal rank
@@ Property / cites work @@
+A greedy approximation for minimum connected dominating sets
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:513269