On the complexity of the one-terminal network design problem (Q1169929): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(82)90007-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044456997 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The One-Terminal TELPAK Problem / rank | |||
Normal rank | |||
Latest revision as of 17:01, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the one-terminal network design problem |
scientific article |
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
