An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03816-7_9
+Normal rank
@@ Property / OpenAlex ID @@
+W1830560292
@@ Property / OpenAlex ID: W1830560292 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Toward a unified approach for the classification of NP-complete optimization problems
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Wavelength Management in WDM Rings to Maximize the Number of Connections
+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 @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+Differential approximation algorithms for some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725269
@@ Property / cites work: Q5725269 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+z-Approximations
@@ Property / cites work: z-Approximations / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
+Normal rank