Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331)
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: Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint |
scientific article; zbMATH DE number 7367758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint |
scientific article; zbMATH DE number 7367758 |
Statements
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (English)
0 references
5 July 2021
0 references
non-submodular optimization
0 references
cardinality constraint
0 references
submodularity ratio
0 references
parallel algorithm
0 references
0 references
0 references
0 references
0.9633526802062988
0 references
0.9247961640357972
0 references
0.8768615126609802
0 references
0.8715764880180359
0 references
0.8655920624732971
0 references
