A Self-Stabilizing Algorithm for the Steiner Tree Problem

Authors:
Sayaka Kamei;Hirotsugu Kakugawa
Affiliations:
-;-
Venue:
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Year:
2002

Citing 0
Cited 2

A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self-stabilization is a theoretical framework of non-masking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a self-stabilizing solution to the problem. Our solution is based on Pruned-MST technique; thePruned-MST method is a heuristic technique to find a minimal cost Steiner tree by pruning unnecessary nodes and edges in minimum cost spanning tree, provided that a minimum spanning tree is available. Finally we propose an algorithm to reduce the cost of the solution.