Shortest Connection Networks on Triangular Grids

Jie Mei, University of Rhode Island

Abstract

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.^

Subject Area

Computer science

Recommended Citation

Jie Mei, "Shortest Connection Networks on Triangular Grids" (2018). Dissertations and Master's Theses (Campus Access). Paper AAI10681798.
https://digitalcommons.uri.edu/dissertations/AAI10681798

Share

COinS