Improving the heuristic algorithms to solve a steiner-minimal-tree problem in large size sparse graphs

This paper proposes an improvement for two heuristic algorithms, PD-Steiner and SPT-Steiner, to solve a SMT problem in large size sparse graphs with edge weights not exceeding 10, and validates this proposal on large-size sparse graphs up to 100000 vertices. These experimental results are useful information for further research on the SMT problem.
Nội dung trích xuất từ tài liệu:
Improving the heuristic algorithms to solve a steiner-minimal-tree problem in large size sparse graphs