[PDF][PDF] A Simple Algorithm for Steiner Tree Problem in Networks
S Kumar - Int. J. Appl. or Innov. Eng. Manag, 2014 - academia.edu
Many problems in combinatorial optimization are known to be NP-hard, and thus it is
unlikely that there exists any polynomialtime algorithm to solve them. A number of these …
unlikely that there exists any polynomialtime algorithm to solve them. A number of these …