Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
Introduction to algorithms
How to find biconnected components in distributed networks
Journal of Parallel and Distributed Computing
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity
SIAM Journal on Computing
Sub-linear distributed algorithms for sparse certificates and biconnected components
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Connectivity and network flows
Handbook of combinatorics (vol. 1)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Distributed algorithms for sparse k-connectivity certificates
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
SIAM Journal on Computing
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Approximation algorithm for k-node connected subgraphs via critical graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Some simple distributed algorithms for sparse networks
Distributed Computing
The expected value of random minimal length spanning tree of a complete graph
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Hi-index | 5.23 |
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 approximation algorithm to construct a minimum-weight k-connected spanning subgraph in a metric graph, an NP-hard problem. We show that our algorithm gives an approximation ratio of O(klogn) for a metric graph, O(k) for a random graph with nodes uniformly randomly distributed in [0,1]2 and for a complete graph with random edge weights U(0,1). We show that our scheme is optimal with respect to the amount of "local information" needed to compute any connected spanning subgraph. We then show that our scheme can be applied to design an efficient distributed algorithm for constructing such an approximate k-connected spanning subgraph (for any k≥1) in a point-to-point distributed model, where the processors form a complete network. Our algorithm takes time and an expected number of messages. Our result in conjunction with a result of Korach et al. [E. Korach, S. Moran, S. Zaks, The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors, SIAM Journal on Computing 16 (2) (1987) 231-236] implies that the expected message complexity of our algorithm is significantly better than the best distributed algorithm that finds an optimal k-connected subgraph. We also show that for geometric instances, our randomized scheme constructs low-degree k-connected spanning subgraphs which have O(klogn) maximum degree, with high probability.