The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434)
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 6945413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions |
scientific article; zbMATH DE number 6945413 |
Statements
The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (English)
0 references
28 September 2018
0 references
\(M^{\natural}\)-convex set functions
0 references
DC programming
0 references
matroid
0 references
NP-hardness
0 references
0.748221218585968
0 references
0.7353769540786743
0 references
0.7299671769142151
0 references
0.7254659533500671
0 references
0.7247680425643921
0 references
