A NEW APPROACH BASED ON LEARNING AUTOMATA FOR SOLVING STEINER TREE PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NOFERESTI SAMIRA; MEYBODI MOHAMMAD REZA

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2008 | Volume:6 | Issue:3 (A) Page(s): 53-59

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,277

Download:

Cites:

Information Journal Paper

Title

A NEW APPROACH BASED ON LEARNING AUTOMATA FOR SOLVING STEINER TREE PROBLEM

Author(s)

NOFERESTI SAMIRA | MEYBODI MOHAMMAD REZA | Issue Writer Certificate

Keywords

WAVELET STATIC STEINER TREE PROBLEMQ3

DYNAMIC STEINER TREE PROBLEMQ3

LEARNING AUTOMATAQ3

HARD PROBLEMSQ3

Abstract

The Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. The Steiner tree problem on graphs is one of the best-known NP-hard problems. For this reason, many approximation algorithms for solving steiner tree problem have been proposed. The traditional algorithms achieve near optimal results, but cost more computational time. In this paper we propose an iterative algorithm based on LEARNING AUTOMATA for solving DYNAMIC STEINER TREE PROBLEM. Simulation results show that our proposed algorithm generates Steiner trees of low cost in reasonable running time.

Cites

No record.

References

No record.

Cite

APA: Copy

NOFERESTI, SAMIRA, & MEYBODI, MOHAMMAD REZA. (2008). A NEW APPROACH BASED ON LEARNING AUTOMATA FOR SOLVING STEINER TREE PROBLEM. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 6(3 (A)), 53-59. SID. https://sid.ir/paper/70662/en

Vancouver: Copy

NOFERESTI SAMIRA, MEYBODI MOHAMMAD REZA. A NEW APPROACH BASED ON LEARNING AUTOMATA FOR SOLVING STEINER TREE PROBLEM. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2008;6(3 (A)):53-59. Available from: https://sid.ir/paper/70662/en

IEEE: Copy

SAMIRA NOFERESTI, and MOHAMMAD REZA MEYBODI, “A NEW APPROACH BASED ON LEARNING AUTOMATA FOR SOLVING STEINER TREE PROBLEM,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 6, no. 3 (A), pp. 53–59, 2008, [Online]. Available: https://sid.ir/paper/70662/en

Related Journal Papers