A refined analysis of submodular greedy (Q2060587): Difference between revisions

@@ Property / OpenAlex ID @@
+W3159636333
@@ Property / OpenAlex ID: W3159636333 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for maximizing submodular functions
+Normal rank
@@ Property / cites work @@
+The generalized maximum coverage problem
@@ Property / cites work: The generalized maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of Information Theory
@@ Property / cites work: Elements of Information Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
+Normal rank
@@ Property / cites work @@
+A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Comparison theorems for differential equations
@@ Property / cites work: Comparison theorems for differential equations / 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
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank