Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms |
scientific article; zbMATH DE number 6022290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms |
scientific article; zbMATH DE number 6022290 |
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
0 references
0 references
0 references
0 references
0.9046620726585388
0 references
0.9025700092315674
0 references
0.881300687789917
0 references
0.8728099465370178
0 references
0.870904266834259
0 references
