Two-stage non-submodular maximization (Q6111964): Difference between revisions

@@ 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 @@
+Maximize a monotone function with a generic submodularity ratio
+Normal rank
@@ Property / cites work @@
+Optimal Value of Information in Graphical Models
@@ Property / cites work: Optimal Value of Information in Graphical Models / rank @@
+Normal rank
@@ Property / cites work @@
+New performance guarantees for the greedy maximization of submodular set functions
+Normal rank
@@ Property / cites work @@
+Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Approximating the least core value and least core of cooperative games with supermodular costs
+Normal rank
@@ Property / cites work @@
+A constrained two-stage submodular maximization
@@ Property / cites work: A constrained two-stage submodular maximization / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6111964