An Improved Steiner Tree Algorithm in Graph

Publish Year: 1390
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,893

This Paper With 5 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

CSCCIT01_151

تاریخ نمایه سازی: 8 بهمن 1390

Abstract:

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph, which it is NP-complete. In this paper, we first review one of the existing algorithms for solving the Steiner problem in graphs, Shortest Path Heuristic algorithm, then presenting a new heuristic algorithm ISPH to improve it. We describe our algorithm and its computational results. It is shown that our algorithm can effectively improve the performance on SPH.

Keywords:

Steiner Tree problem- heuristic algorithm- SPH algorithm

Authors

ali Nourollah

Department of Electrical and Computer Engineering of Shahid Rajaee Teacher Training University

elnaz pashaei

Department of Electrical, Computer and IT Engineering, Qazvin Islamic Azad University

elham pashaei

Department of Electrical, Computer and IT Engineering, Qazvin Islamic Azad University

mohammad reza meybodi

Department of IT & Computer Engineering, Amirkabir University of Technology,

مراجع و منابع این Paper:

لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :
  • Z. Kun, W. Heng, and L. Feng-Yu, "Distributed multicast routing ...
  • G. Kulkarni, "A Tabu Search Algorithm for the Steiner Tree ...
  • C. C. Ribeiro and M C. TDe Souza, "Improved Tabu ...
  • S.M. Wang, "A multiple source algorithm for suboptimum Steiner trees ...
  • D. E. Drake and S. Hougardy, _ Approximation Algorithms for ...
  • M. Demange, J. Momnot, and V Th. Paschos, "Differential Approximation ...
  • G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in ...
  • V. v. Vazirani, "Recent resuls on approximating the Steiner tree ...
  • L. Gatani, G. Lo Re, and S. Gaglio, "An efficient ...
  • H. Takahashi and A.Matsuyama, _ approximate solution for the Steiner ...
  • First CSUT Conference on Computer, Communic ation, Information Technology November ...
  • N. P. Chen, "New algorithm for Steiner tree on graphs", ...
  • نمایش کامل مراجع