Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:43, 8 February 2024
scientific article; zbMATH DE number 6316352
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints |
scientific article; zbMATH DE number 6316352 |
Statements
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (English)
0 references
11 July 2014
0 references
submodular maximization
0 references
knapsack constraints
0 references
maximum coverage
0 references
generalized assignment problem
0 references
randomization
0 references
approximation algorithms
0 references
