Best Algorithms for Approximating the Maximum of a Submodular Set Function (Q4178796): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.3.3.177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997783781 / rank | |||
Normal rank | |||
Latest revision as of 15:28, 19 March 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
