A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms

The main focus of this paper is the analysis of a simple randomized scheme for constructing low-weight k -connected spanning subgraphs. In this paper, we focus on the metric graph. We use the term metric graph for a complete graph with metric weights. We first show that our scheme gives a simple app...

Ausführliche Beschreibung