A Survey on the Steiner Forest Problem, M.Sc. Thesis Sharif University of Technology ; Foroughmand-Arabi, Mohammad Hadi (Supervisor)
Abstract
The Steiner forest problem is one of the most fundamental issues in network design that emerges in various contexts, such as the design of communication networks,transportation networks, VLSI circuits and phylogenetic network reconstruction. In this problem, we are given a connected weighted undirected graph and a special subset of vertices that are partitioned in pairs. The goal is to fnd a minimum-cost sub-graph in which each special vertex is connected to its mate. In this thesis we review a set of selected solutions for this problem and a few other related problems.For example, we study modeling and solving the s-t shortest path problem in order to gain insight into current Steiner...
Cataloging briefA Survey on the Steiner Forest Problem, M.Sc. Thesis Sharif University of Technology ; Foroughmand-Arabi, Mohammad Hadi (Supervisor)
Abstract
The Steiner forest problem is one of the most fundamental issues in network design that emerges in various contexts, such as the design of communication networks,transportation networks, VLSI circuits and phylogenetic network reconstruction. In this problem, we are given a connected weighted undirected graph and a special subset of vertices that are partitioned in pairs. The goal is to fnd a minimum-cost sub-graph in which each special vertex is connected to its mate. In this thesis we review a set of selected solutions for this problem and a few other related problems.For example, we study modeling and solving the s-t shortest path problem in order to gain insight into current Steiner...
Find in contentBookmark |
|