The minimum latency problem is NP-hard for weighted trees (Q4737530)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2086925
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum latency problem is NP-hard for weighted trees |
scientific article; zbMATH DE number 2086925 |
Statements
11 August 2004
0 references
0.8114898204803467
0 references
0.7971833944320679
0 references
0.7968089580535889
0 references
0.7949069738388062
0 references
The minimum latency problem is NP-hard for weighted trees (English)
0 references