Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:00, 6 February 2024
scientific article; zbMATH DE number 3614518
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
