Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109309418 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1101.2940 / rank | |||
Normal rank | |||
Latest revision as of 23:33, 19 April 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
