On the complexity of the one-terminal network design problem (Q1169929)
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 3780915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the one-terminal network design problem |
scientific article; zbMATH DE number 3780915 |
Statements
On the complexity of the one-terminal network design problem (English)
0 references
1982
0 references
NP-hardness
0 references
computational complexity
0 references
one terminal network design
0 references
network topology
0 references
minimum spanning tree
0 references
optimal solution
0 references
proportional to distance travel costs
0 references
construction costs
0 references
usage costs
0 references
