Back to search

University of Nevada - Reno

A Parallel Application for Tree Selection in the Steiner Minimal Tree Problem

Abstract

dc:description.abstract

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.

Degree

thesis:*
Level thesis:degree_level
Master's Degree
Department thesis:degree_department
Computer Science and Engineering
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Hegie, Joshua M.
Advisor dc:contributor.advisor
  • Harris, Frederick C.
Committee members dc:contributor.committeemember
  • Gunes, Mehmet H.
  • Panorska, Anna K.

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • In Copyright(All Rights Reserved)
  • Author(s)

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/11714/2622

Chain of custody

source
Harvested from
University of Nevada - Reno
Base URL
scholarwolf.unr.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Hegie, Joshua M.. A Parallel Application for Tree Selection in the Steiner Minimal Tree Problem. Master's Degree thesis, 2015. http://hdl.handle.net/11714/2622