A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(03)00062-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033885045 / rank | |||
Normal rank | |||
Latest revision as of 09:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on maximizing a submodular set function subject to a knapsack constraint |
scientific article |
Statements
A note on maximizing a submodular set function subject to a knapsack constraint (English)
0 references
1 July 2004
0 references
Submodular function
0 references
Approximation algorithm
0 references
