@article {IOPORT.06073277,
    author       = {Dolagh, Safar Vafadar and Moazzami, Dara},
    title        = {New approximation algorithm for minimum Steiner tree problem.},
    year         = {2011},
    journal      = {International Mathematical Forum},
    volume       = {6},
    number       = {53-56},
    issn         = {1312-7594},
    pages        = {2625-2636},
    publisher    = {Hikari Ltd., Ruse},
    abstract     = {Summary: The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices which are called required. If the edge weights are all positive, then the resulting subgraph is obviously a tree. The computational nature of the problem makes it a traditional research subject in theory of computing. Steiner tree problem in graphs is NP-complete, i.e., the exact optimal solutions are unlikely computable in polynomial-time unless P=NP. We present a new polynomial time approximation algorithm that achieves an approximation ratio of 1.5 in most graphs, which improves upon the previously best-known approximation algorithm ratio of 1.55.},
    identifier   = {06073277},
}