Algorithms and lower bounds for submodular cuts and approximating submodular functions (Q2999659)
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 5888313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and lower bounds for submodular cuts and approximating submodular functions |
scientific article; zbMATH DE number 5888313 |
Statements
16 May 2011
0 references
submodular sparsest cut problem
0 references
lower bounds
0 references
approximability
0 references
submodular balanced cut problem
0 references
0.9014555215835572
0 references
0.8232178092002869
0 references
0.8067066669464111
0 references
