LP relaxation and tree packing for minimum \(k\)-cut (Q3300759)
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 7225939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP relaxation and tree packing for minimum \(k\)-cut |
scientific article; zbMATH DE number 7225939 |
Statements
LP Relaxation and Tree Packing for Minimum $k$-Cut (English)
0 references
30 July 2020
0 references
\(k\)-cut
0 references
minimum cut
0 references
tree packing
0 references
approximation
0 references
0 references
0 references
0 references
0.8650380969047546
0 references
0.8260865807533264
0 references
0.7988166213035583
0 references
0.7982383966445923
0 references
