Approximating the dense set-cover problem (Q1765297): Difference between revisions

@@ Property / author @@
-Reuven Bar Yehuda
@@ Property / author: Reuven Bar Yehuda / rank @@
-Normal rank
@@ Property / author @@
+Reuven Bar Yehuda
@@ Property / author: Reuven Bar Yehuda / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2004.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2075346653
@@ Property / OpenAlex ID: W2075346653 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for the weighted vertex cover problem
+Normal rank
@@ Property / cites work @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2712300
@@ Property / cites work: Q2712300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952635
@@ Property / cites work: Q4952635 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Set Covering and Vertex Cover Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4395327
@@ Property / cites work: Q4395327 / rank @@
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and an approximation algorithm for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+An approximation of the minimum vertex cover in a graph
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank