A given diameter MST on a random graph

DOI10.1007/978-3-030-62867-3_9zbMath1506.90074OpenAlexW3097316775MaRDI QIDQ2679776

Aleksandr S. Shevyakov, Alexandr A. Shtepa, E. Kh. Gimadi

Publication date: 25 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-62867-3_9

zbMATH Keywords

approximation algorithmprobabilistic analysisgiven-diameter minimum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18)

Related Items (2)

On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter ⋮ On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights

This page was built for publication: A given diameter MST on a random graph