Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293): Difference between revisions

@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+An 0. 828-approximation algorithm for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Maximizing a class of submodular utility functions
+Normal rank
@@ Property / cites work @@
+Approximating the least core value and least core of cooperative games with supermodular costs
+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
@@ Property / cites work @@
+Q4633865
@@ Property / cites work: Q4633865 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
+Normal rank
@@ Property / Wikidata QID @@
+Q127913651
@@ Property / Wikidata QID: Q127913651 / rank @@
+Normal rank