A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658): Difference between revisions

@@ 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 @@
+An Exact Algorithm for Maximum Entropy Sampling
@@ Property / cites work: An Exact Algorithm for Maximum Entropy Sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained Maximum-Entropy Sampling
@@ Property / cites work: Constrained Maximum-Entropy Sampling / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(03)00062-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2033885045
@@ Property / OpenAlex ID: W2033885045 / rank @@
+Normal rank