Stochastic-lazier-greedy algorithm for monotone non-submodular maximization (Q2666680): Difference between revisions

@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q3112637
@@ Property / cites work: Q3112637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3096214
@@ Property / cites work: Q3096214 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3096108
@@ Property / cites work: Q3096108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4806224
@@ Property / cites work: Q4806224 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149262
@@ Property / cites work: Q4149262 / rank @@
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank