A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252)
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: A tight bound on the min-ratio edge-partitioning problem of a tree |
scientific article; zbMATH DE number 5819489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight bound on the min-ratio edge-partitioning problem of a tree |
scientific article; zbMATH DE number 5819489 |
Statements
A tight bound on the min-ratio edge-partitioning problem of a tree (English)
0 references
25 November 2010
0 references
tree
0 references
partition
0 references
optimization problem
0 references
algorithm
0 references
0.8874820470809937
0 references
0.8350063562393188
0 references
0.834391176700592
0 references
0.8208009004592896
0 references
0.807813823223114
0 references
