Before revision:  Our BDD traverse algorithm controls the number of generated Steiner trees  to reduce the memory and computation costs  .
After revision:  Our BDD traverse algorithm prunes Steiner trees with costs larger than the threshold. We also extend our algorithm by preprocessing the given graph and controlling the number of generated Steiner trees to reduce the memory and computation costs .