Date of Award


Degree Type


Degree Name

Master of Science in Computer Science


Computer Science and Statistics

First Advisor

Edmund Lamagna


The shortest path problem, or the Steiner problem, is an interesting problem with numerous real-world applications. Historically the Steiner problem has been studied for the Euclidean plane and for rectilinear distances. Both problems have been proven to be NP-hard. In this research, we look into the Steiner problem on a triangular grid and show that the problem is NP-hard. We explore exact algorithms for constructing a shortest network that optimally interconnects a set of terminal points on a grid. Moreover, we look at a heuristic algorithm to solve the problem and provide a conjecture on the bound of the approximation it produces.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.