Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING   FALL 2008 , Volume 6 , Number 3 (A); Page(s) 53 To 59.
 
Paper: 

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

 
 
Author(s):  NOFERESTI SAMIRA, MEYBODI MOHAMMAD REZA
 
* 
 
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.

 
Keyword(s): WAVELET STATIC STEINER TREE PROBLEM, DYNAMIC STEINER TREE PROBLEM, LEARNING AUTOMATA, HARD PROBLEMS
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 79
 
Latest on Blog
Enter SID Blog