On the \(K\) shortest path trees problem (Q1040982): 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.1016/j.ejor.2009.06.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1964122629 / rank | |||
Normal rank | |||
Revision as of 19:13, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the \(K\) shortest path trees problem |
scientific article |
Statements
On the \(K\) shortest path trees problem (English)
0 references
27 November 2009
0 references
network/graphs
0 references
\(K\) shortest path trees problem
0 references
shortest path tree problem
0 references
\(K\) best spanning tree
0 references
\(K\) best solutions
0 references
