On complexity of maximizatin of submodular functions<sup>*</sup> (Q4256098): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331939808844419 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014472857 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of Matroid Property Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower bounds on the worst-case complexity of some oracle algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Every poset has a central element / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching in Trees, Series-Parallel and Interval Orders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching ordered structures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching in 2-dimensional partial orders / rank | |||
Normal rank | |||
Latest revision as of 20:59, 28 May 2024
scientific article; zbMATH DE number 1309138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of maximizatin of submodular functions<sup>*</sup> |
scientific article; zbMATH DE number 1309138 |
Statements
On complexity of maximizatin of submodular functions<sup>*</sup> (English)
0 references
22 May 2000
0 references
Shannon-optimal algorithm
0 references
local maxima
0 references
submodular function
0 references
