Implementation and Performance of STAR Algorithm[go to overview]
Our implementation introduces interesting techniques: 1. Create an underlying container data structure for all vertices and edges instances to save memory space. 2. For the first phase of the algorithm, we artificially add necessary edges to connect the required vertices, so that the first initial steiner tree can be build as soon as possible. We also present recent results of the performance experiment of the algorithm.
28.08.14 - 08:15