If you have any problems related to the accessibility of any content (or if you want to request that a specific publication be accessible), please contact (firstname.lastname@example.org). We will work to respond to each request in as timely a manner as possible.
A Parallel Application for Tree Selection in the Steiner Minimal Tree Problem
AuthorHegie, Joshua M.
AdvisorHarris, Frederick C.
Computer Science and Engineering
AltmetricsView Usage Statistics
A classic optimization problem in mathematics is the problem of determining the shortest possible length for a network of points. One of these problems, that remains relevant even today, is the Steiner Minimal Tree problem. This problem is focused on finding a connected graph for a cloud of points that minimizes the overall distance of the tree. This problem has applications in fields such as telecommunications, determining where to geographically place hubs such that the total length of run cabling is minimized, and for a special case of the problem, circuit design.