On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter (Q6082044): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the value of a random minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of a Random Minimum Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A given diameter MST on a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3863698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below / rank
 
Normal rank

Latest revision as of 10:55, 3 August 2024

scientific article; zbMATH DE number 7760877
Language Label Description Also known as
English
On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter
scientific article; zbMATH DE number 7760877

    Statements

    On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter (English)
    0 references
    0 references
    0 references
    3 November 2023
    0 references
    minimum spanning tree with given diameter
    0 references
    approximation algorithm
    0 references
    probabilistic analysis
    0 references
    asymptotic optimality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references