Approximating minimum \(k\)-section in trees with linear diameter (Q324723)
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: Approximating minimum k-section in trees with linear diameter |
scientific article; zbMATH DE number 6639872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum \(k\)-section in trees with linear diameter |
scientific article; zbMATH DE number 6639872 |
Statements
Approximating minimum \(k\)-section in trees with linear diameter (English)
0 references
17 October 2016
0 references
minimum \(k\)-section
0 references
approximation algorithm
0 references
0.8033689260482788
0 references
0.7910043597221375
0 references
0.7793526649475098
0 references
0.7675374746322632
0 references
0.7449996471405029
0 references
