A clustering-based algorithm for the rectilinear steiner tree problem

(1994) A clustering-based algorithm for the rectilinear steiner tree problem. Masters thesis, King Fahd University of Petroleum and Minerals.


Download (2MB) | Preview

Arabic Abstract


English Abstract

The Steiner Tree Problem is the determination of the shortest connecting length between a given set of points and additional points. The Rectilinear Steiner Tree Problem is the same as above but the connecting lines are confined to the horizontal or vertical lines only (L₁ metric). A cluster is a set of points that influence each other locally. This research gives a new algorithm based on a clustering metric that determines much less steiner points locally in a cluster as well as those external to it. The algorithm matches the worst-case time complexity of O(nlogn) of previous authors while giving better average results then theirs. In addition a Neural Solution to the Steiner problem in Networks, which is a graph-theoretic representation of the problem, is explored and its limitations presented.

Item Type: Thesis (Masters)
Subjects: Computer
Department: College of Computing and Mathematics > Information and Computer Science
Committee Advisor: Er, Meng
Committee Members: Faisal, Kanaan Abed and Braham, Rafik
Depositing User: Mr. Admin Admin
Date Deposited: 22 Jun 2008 13:55
Last Modified: 01 Nov 2019 13:56
URI: https://eprints.kfupm.edu.sa/id/eprint/10046