Browsing Mathematics (Faculty of) by Subject "Steiner tree"
Now showing items 1-2 of 2
-
On the Role of Partition Inequalities in Classical Algorithms for Steiner Problems in Graphs
(University of Waterloo, 2006)The Steiner tree problem is a classical, well-studied, $\mathcal{NP}$-hard optimization problem. Here we are given an undirected graph $G=(V,E)$, a subset $R$ of $V$ of terminals, and non-negative costs $c_e$ for all ... -
The Steiner Ratio for the Obstacle-Avoiding Steiner Tree Problem
(University of Waterloo, 2008-09-26)This thesis examines the (geometric) Steiner tree problem: Given a set of points P in the plane, find a shortest tree interconnecting all points in P, with the possibility of adding points outside P, called the Steiner ...