On the minimum routing cost clustered tree problem (Q2359809): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-016-0026-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2373493542 / rank | |||
Normal rank | |||
Revision as of 19:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimum routing cost clustered tree problem |
scientific article |
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
