How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Kernel(s) for problems with no kernel
@@ Property / cites work: Kernel(s) for problems with no kernel / rank @@
+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 @@
+Leafy spanning arborescences in DAGs
@@ Property / cites work: Leafy spanning arborescences in DAGs / rank @@
+Normal rank
@@ Property / cites work @@
+Broadcasting on Random Directed Acyclic Graphs
@@ Property / cites work: Broadcasting on Random Directed Acyclic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+Q2708231
@@ Property / cites work: Q2708231 / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy Local Improvement and Weighted Set Packing Approximation
+Normal rank
@@ Property / cites work @@
+Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
+Normal rank
@@ Property / cites work @@
+Leafy spanning arborescences in DAGs
@@ Property / cites work: Leafy spanning arborescences in DAGs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
+Normal rank