Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:35, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms |
scientific article |
Statements
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (English)
0 references
5 April 2012
0 references
non-monotone submodular set functions
0 references
approximation algorithms
0 references
continuous greedy process
0 references
matroid
0 references
knapsack
0 references
cardinality
0 references