Uniform unweighted set cover: the power of non-oblivious local search (Q631761): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W1991242013
@@ Property / OpenAlex ID: W1991242013 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Approximation Results for Local Search Algorithms
+Normal rank
@@ Property / cites work @@
+On Local Search for Weighted <i>k</i>-Set Packing
@@ Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+A modified greedy heuristic for the set covering problem with improved worst case bound
+Normal rank
@@ Property / cites work @@
+Q4886045
@@ Property / cites work: Q4886045 / rank @@
+Normal rank
@@ Property / cites work @@
+A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
+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 @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+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 @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Analysis of the Greedy Algorithm for Set Cover
+Normal rank