<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T20:18:11Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/16229" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/16229</identifier><datestamp>2025-03-26T23:33:02Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Cheriyan, Joseph</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="18728601-de5a-4bec-955b-83e839e6f220" confidence="600">Grout, Logan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-09-02T17:56:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-09-02T17:56:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-09-02</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2020-08-25</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/16229</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis focuses on the Node-Connectivity Tree Augmentation Problem (NC-TAP), formally defined as follows. The first input of the problem is a graph G which has  vertex set V and edge set E. We require |V| &amp;gt;= 3 to avoid degenerate cases. The  edge set E is a disjoint union of two sets T and L where the subgraph (V,T) is  connected and acyclic. We call the edges in T the tree edges and the edges in  L are called links. The second input is a vector c in R^L, c &amp;gt;= 0  (a vector of nonnegative real numbers indexed by the links), which is called the  cost of the links. We often refer to this graph G and cost vector c as an  instance of NC-TAP. Given an instance G = (V, T U L) and c to NC-TAP, a feasible solution to that instance is a set  of links F such that the graph (V, T U F) is 2-connected. The  cost of a set of links. The goal of NC-TAP is to find a feasible solution F^* to the given instance such that the the cost of F^* is minimum among all feasible solutions to the instance.&#xd;
&#xd;
This thesis is mainly expository and it has two goals. First, we present the current best-known algorithms for NC-TAP. The second goal of this thesis is to explore new directions in the study of NC-TAP in the last chapter. This is an exploratory chapter where the goal is to use the state of the art techniques for TAP to develop an algorithm for NC-TAP which has an approximation guarantee better than factor 2.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorial optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree augmentation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Augmenting Trees to Achieve 2-Node-Connectivity</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Cheriyan, Joseph</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>