Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066)
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: Complexity and approximations for submodular minimization problems on two variables per inequality constraints |
scientific article; zbMATH DE number 6966415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximations for submodular minimization problems on two variables per inequality constraints |
scientific article; zbMATH DE number 6966415 |
Statements
Complexity and approximations for submodular minimization problems on two variables per inequality constraints (English)
0 references
26 October 2018
0 references
submodular optimization
0 references
approximation algorithms
0 references
submodular closure
0 references
monotone constraints
0 references
0 references
0 references
0 references
0.8052808046340942
0 references
0.7886818647384644
0 references
0.7793470621109009
0 references
