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 controls the number of generated Steiner trees to reduce the memory and computation costs . The extension makes our algorithm scalable by generating a subset of the minimal Steiner trees .