Approximation algorithms for some optimum communication spanning tree problems (Q1566575): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum Communication Spanning Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of the network design problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3707420 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250159 / rank | |||
Normal rank |
Revision as of 15:28, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for some optimum communication spanning tree problems |
scientific article |
Statements
Approximation algorithms for some optimum communication spanning tree problems (English)
0 references
27 November 2000
0 references
undirected graph
0 references