The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396)
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 1723875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cable trench problem: Combining the shortest path and minimum spanning tree problems |
scientific article; zbMATH DE number 1723875 |
Statements
The cable trench problem: Combining the shortest path and minimum spanning tree problems (English)
0 references
10 October 2002
0 references
cable-trench problem
0 references
spanning tree
0 references
NP-complete
0 references
0 references
0.8815228
0 references
0.84508705
0 references
0.8445034
0 references
0.84178805
0 references
0.8403143
0 references
0.8384283
0 references
0.8365899
0 references
0.8360683
0 references
