Algorithms for the optimum communication spanning tree problem (Q2507388): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-006-7382-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058966397 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constrained Optimum Communication Trees and Sensitivity Analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of the network design problem / rank | |||
Normal rank | |||
Latest revision as of 21:37, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the optimum communication spanning tree problem |
scientific article |
Statements
Algorithms for the optimum communication spanning tree problem (English)
0 references
11 October 2006
0 references
cost of communication
0 references
cut-tree
0 references
star-tree
0 references
adjacent spanning tree
0 references
adjacent basic feasible solution
0 references
