Parallel algorithms for steiner tree problem

Joon Sang Park, Won W. Ro, Handuck Lee, Neungsoo Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Pages453-455
Number of pages3
DOIs
Publication statusPublished - 2008
Event3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 - Busan, Korea, Republic of
Duration: 2008 Nov 112008 Nov 13

Publication series

NameProceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
Volume1

Other

Other3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008
CountryKorea, Republic of
CityBusan
Period08/11/1108/11/13

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Software

Fingerprint Dive into the research topics of 'Parallel algorithms for steiner tree problem'. Together they form a unique fingerprint.

  • Cite this

    Park, J. S., Ro, W. W., Lee, H., & Park, N. (2008). Parallel algorithms for steiner tree problem. In Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008 (pp. 453-455). [4682068] (Proceedings - 3rd International Conference on Convergence and Hybrid Information Technology, ICCIT 2008; Vol. 1). https://doi.org/10.1109/ICCIT.2008.167