Yayın:
A new Steiner tree algorithm based on Sollin's algorithm in graphs

Basit öğe sayfası
dc.contributor.authorPashaei, Elnaz
dc.contributor.authorNourollah, Ali
dc.contributor.authorMeybodi, Mohammad Reza
dc.date.accessioned2026-01-25T01:40:35Z
dc.date.issued2012-05-01
dc.description.abstractThe minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper, we introduce a new heuristic algorithm based on Sollin's algorithm for solving the Steiner tree problem in graph. We describe our algorithm and its computational results. It is shown that our algorithm has a good performance in achieving a Steiner tree and is comparable with other existing solutions.
dc.description.urihttps://doi.org/10.1109/csae.2012.6272820
dc.description.urihttps://dx.doi.org/10.1109/csae.2012.6272820
dc.identifier.doi10.1109/csae.2012.6272820
dc.identifier.endpage493
dc.identifier.openairedoi_dedup___::452ae8cc2c3046616ce30899fb35d55d
dc.identifier.orcid0000-0001-9391-9785
dc.identifier.orcid0000-0002-4968-8147
dc.identifier.startpage489
dc.identifier.urihttps://hdl.handle.net/11527/41621
dc.publisherIEEE
dc.relation.ispartof2012 IEEE International Conference on Computer Science and Automation Engineering (CSAE)
dc.titleA new Steiner tree algorithm based on Sollin's algorithm in graphs
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyonlar

Yayınlar