An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615)
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: An efficient algorithm for the length-constrained heaviest path problem on a tree |
scientific article; zbMATH DE number 6594018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the length-constrained heaviest path problem on a tree |
scientific article; zbMATH DE number 6594018 |
Statements
An efficient algorithm for the length-constrained heaviest path problem on a tree (English)
0 references
16 June 2016
0 references
network design
0 references
trees
0 references
heaviest path problem
0 references
0 references
0.9257177
0 references
0.9058842
0 references
0.90284437
0 references
0.8988462
0 references
0.8960055
0 references
0 references
0 references
