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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 385; no. 1; pp. 101 - 114
Main Authors:	Khan, Maleq, Pandurangan, Gopal, Anil Kumar, V.S.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.10.2007 Elsevier
Subjects:	[formula omitted]-connected spanning subgraph Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Distributed algorithm Exact sciences and technology Graph theory Information retrieval. Graph Mathematics Minimum spanning tree Miscellaneous Probabilistic analysis Randomized approximation algorithm Sciences and techniques of general use Theoretical computing Randomized approximation algorithm Probabilistic analysis k -connected spanning subgraph Minimum spanning tree Distributed algorithm Construction Approximation Processor k-connected spanning subgraph Computer theory Complete graph Graph node Probability Probability distribution Approximation algorithm Computing Complexity Random graph Design Maximum Spanning tree NP hard problem Subgraph Application
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!