Parallel Algorithms for Steiner Tree Problem

Authors:
Joon-Sang Park;Won W. Ro;Handuck Lee;Neungsoo Park
Affiliations:
-;-;-;-
Venue:
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
Year:
2008

Citing 0
Cited 1

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Steiner tree problem seeks for the shortest tree connecting a given set of terminal points. This paper discusses parallelization of algorithms for the Steiner tree problem. First, a 2-approximation algorithm due to Takahashi and Matsuyama is parallelized for PRAM(Parallel Random Access Machine) model, and then issues in parallelizing another 2-approximation heuristic, namely, Kou, Markowsky, and Berman algorithm and other advance heuristics achieving less approximation ratio are discussed.