An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070523096 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the length-constrained heaviest path problem on a tree |
scientific article |
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
