Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966)
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: Greedy is good: constrained non-submodular function maximization via weak submodularity |
scientific article; zbMATH DE number 7910601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy is good: constrained non-submodular function maximization via weak submodularity |
scientific article; zbMATH DE number 7910601 |
Statements
Greedy is good: constrained non-submodular function maximization via weak submodularity (English)
0 references
11 September 2024
0 references
non-submodular function
0 references
\(p\)-matroid intersection
0 references
\(p\)-extendible system
0 references
\(p\)-system
0 references
greedy algorithm
0 references
0 references
0 references
0.9297724962234496
0 references
0.8779237270355225
0 references
0.8679335117340088
0 references
0.8659359812736511
0 references
0.8598123788833618
0 references
