An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3130543970
@@ Property / OpenAlex ID: W3130543970 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
+Normal rank
@@ Property / cites work @@
+Submodular Maximization with Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q5365101
@@ Property / cites work: Q5365101 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+A Unified Continuous Greedy Algorithm for Submodular Maximization
+Normal rank
@@ Property / cites work @@
+Dependent rounding and its applications to approximation algorithms
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
+Normal rank
@@ Property / cites work @@
+Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Q3549686
@@ Property / cites work: Q3549686 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry and Approximability of Submodular Maximization Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2071828