New performance guarantees for the greedy maximization of submodular set functions (Q523157)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6706490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New performance guarantees for the greedy maximization of submodular set functions |
scientific article; zbMATH DE number 6706490 |
Statements
New performance guarantees for the greedy maximization of submodular set functions (English)
0 references
20 April 2017
0 references
approximation
0 references
cardinality
0 references
convex optimization
0 references
greedy algorithm
0 references
maximization
0 references
steepest ascent
0 references
0 references
0 references
0 references
0 references
0 references
0.8119620680809021
0 references
0.8114344477653503
0 references
0.8085766434669495
0 references
0.8059613108634949
0 references
0.8052815794944763
0 references
