A well-known method to approximate classical Steiner Tree problem is MST Heuristic. It is a polynomial time algorithm. In this algorithm, we first find shortest path from each terminal node to every other terminal node. Then we construct a metric closure with only terminal nodes and shortest paths between them as edges. Then we find an MST on the computed metric closure. Finally the MST is transformed back to a Steiner tree by replacing each edge with the shortest path and some straightforward postprocessing to remove redundant edges.
-
Notifications
You must be signed in to change notification settings - Fork 0
atul2938/Steiner-Tree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
An implementation of heuristic algorithm for solving classical Steiner Tree problem.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published