On the minimum routing cost clustered tree problem (Q2359809)
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: On the minimum routing cost clustered tree problem |
scientific article; zbMATH DE number 6734729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum routing cost clustered tree problem |
scientific article; zbMATH DE number 6734729 |
Statements
On the minimum routing cost clustered tree problem (English)
0 references
22 June 2017
0 references
approximation algorithm
0 references
NP-hard
0 references
spanning tree
0 references
graph algorithm
0 references
0 references
0 references
0 references
0 references
0.90248716
0 references
0 references
0 references
0.89985955
0 references
0.89603764
0 references
0.8956324
0 references
0.8932247
0 references
0.8900325
0 references
