Optimal cuts and partitions in tree metrics in polynomial time (Q396629)
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: Optimal cuts and partitions in tree metrics in polynomial time |
scientific article; zbMATH DE number 6329888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal cuts and partitions in tree metrics in polynomial time |
scientific article; zbMATH DE number 6329888 |
Statements
Optimal cuts and partitions in tree metrics in polynomial time (English)
0 references
13 August 2014
0 references
computational complexity
0 references
optimal cut
0 references
optimal bisection
0 references
tree metric
0 references
geometric metric
0 references
polynomial time
0 references
0.90114045
0 references
0.9003115
0 references
0.8961723
0 references
0.8894538
0 references
0.88793385
0 references
0.88682866
0 references
0.8865316
0 references
0.88583386
0 references
0.8850484
0 references
0.88353336
0 references
