On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter

DOI10.1134/s0005117923070068zbMath1525.05067MaRDI QIDQ6082044

E. Kh. Gimadi, Alexandr A. Shtepa

Publication date: 3 November 2023

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmprobabilistic analysisasymptotic optimalityminimum spanning tree with given diameter

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Cites Work

• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• On the value of a random minimum spanning tree problem
• A given diameter MST on a random graph
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• On the Length of a Random Minimum Spanning Tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter