APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297): Difference between revisions

@@ Property / cites work @@
+Solving huge size instances of the optimal diversity management problem
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Bound for Spanning Star Forest and Color Saving
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A note on finding optimum branchings
@@ Property / cites work: A note on finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for the Spanning Star Forest Problem
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
+Normal rank
@@ Property / cites work @@
+On Variants of the Spanning Star Forest Problem
@@ Property / cites work: On Variants of the Spanning Star Forest Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The diversity of domination
@@ Property / cites work: The diversity of domination / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+A simple derivation of edmonds' algorithm for optimum branchings
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+<i>R</i>             -Domination in Graphs
@@ Property / cites work: <i>R</i> -Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank