Improved approximation of maximum vertex cover (Q2583713): Difference between revisions

@@ 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.orl.2005.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2073925702
@@ Property / OpenAlex ID: W2073925702 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+Cardinality constrained path covering problems in grid graphs
+Normal rank
@@ Property / cites work @@
+Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
+Normal rank
@@ Property / cites work @@
+Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+New  $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+On approximation of max-vertex-cover
@@ Property / cites work: On approximation of max-vertex-cover / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+A probabilistic analysis of the maximal covering location problem
+Normal rank