Maximum Spanning Trees of Random Geometric Graphs With Independent Edge Weights
In this paper, we study maximum weight spanning trees of the random geometric graph (RGG)~\(G\) formed by~\(n\) vertices where each edge is independently either open or closed with a certain probability and is also equipped with an independent random positive weight. We use segmentation and iterative path construction...