On Variants of the Spanning Star Forest Problem (Q3004657): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-21204-8_11
+Normal rank
@@ Property / OpenAlex ID @@
+W170534829
@@ Property / OpenAlex ID: W170534829 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Bound for Spanning Star Forest and Color Saving
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / 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 @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning k-Tree Forest Problem
@@ Property / cites work: Approximating the Spanning k-Tree Forest Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank