This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
Year
Collections
Languages
Item type
Departments
Supervisors
-
Fall 2023
In this thesis, we design approximation algorithms for a variety of problems in Network Design. The first problem we consider is the Directed Steiner Tree (DST) problem where we want to find a cheapest way of connecting a subset of nodes (terminal nodes) from a root node in a directed network. We...
1 - 1 of 1