A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (Q5091208)
From MaRDI portal
scientific article; zbMATH DE number 7561546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint |
scientific article; zbMATH DE number 7561546 |
Statements
21 July 2022
0 references
submodular maximization
0 references
knapsack constraint
0 references
fast algorithms
0 references
0 references
0 references
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint (English)
0 references
