Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796)
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: Best Algorithms for Approximating the Maximum of a Submodular Set Function |
scientific article; zbMATH DE number 3614518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best Algorithms for Approximating the Maximum of a Submodular Set Function |
scientific article; zbMATH DE number 3614518 |
Statements
Best Algorithms for Approximating the Maximum of a Submodular Set Function (English)
0 references
1978
0 references
Best Algorithms
0 references
Submodular Set Function
0 references
Combinatorial Optimization
0 references
Greedy Algorithms
0 references
Partial Enumeration
0 references
Computational Efficiency
0 references
