<?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-22T10:22:30Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/17338" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/17338</identifier><datestamp>2025-03-26T23:36:28Z</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="a6ec2353-64cd-4c1f-aabc-c772d7dacced" confidence="600">Neogi, Rian</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-09-03T15:59:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-09-03T15:59:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-09-03</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2021-08-31</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/17338</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems.&#xd;
In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional set of edges $L \subseteq V\times V$ that we refer to as links.&#xd;
The task is to find a minimum cost subset of links $F \subseteq L$ such that adding F to G makes the graph (k+1)-edge-connected.&#xd;
We first study a special case when k=1, which is equivalent to the Tree Augmentation problem.&#xd;
We present a breakthrough result by Adjiashvili that gives an approximation algorithm for Tree Augmentation with approximation guarantee below 2, under the assumption that the cost of every link $\ell \in L$ is bounded by a constant.&#xd;
The algorithm is based on an elegant decomposition based method and uses a novel linear programming relaxation called the $\gamma $-bundle LP.&#xd;
We then present a subsequent result by Fiorini, Gross, Konemann and Sanita who give a $3/2+\epsilon$ approximation algorithm for the same problem.&#xd;
This result uses what are known as Chvatal-Gomory cuts to strengthen the linear programming relaxation used by Adjiashvili, and uses results from the theory of binet matrices to give an improved algorithm that is able to attain a significantly better approximation ratio.&#xd;
Next, we look at the special case when k=2. This case is equivalent to what is known as the Cactus Augmentation problem.&#xd;
A recent result by Cecchetto, Traub and Zenklusen give a 1.393-approximation algorithm for this problem using the same decomposition based algorithmic framework given by Adjiashvili.&#xd;
We present a slightly weaker result that uses the same ideas and obtains a $3/2+\epsilon $ approximation ratio for the Cactus Augmentation problem.&#xd;
Next, we take a look at the integrality ratio of the natural linear programming relaxation for Tree Augmentation, and present a result by Nutov that bounds this integrality gap by 28/15.&#xd;
Finally, we study the related Forest Augmentation problem that is a generalization of Tree Augmentation.&#xd;
There is no approximation algorithm for Forest Augmentation known that obtains an approximation ratio below 2.&#xd;
We show that we can obtain a 29/15-approximation algorithm for Forest Augmentation under the assumption that the LP solution is half-integral via a reduction to Tree Augmentation.&#xd;
We also study the structure of extreme points of the natural linear programming relaxation for Forest Augmentation and prove several properties that these extreme points satisfy.</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">Approximation Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combinatorial Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Connectivity Augmentation</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Decomposition-based methods for Connectivity Augmentation Problems</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-etd" element="embargo" qualifier="terms" lang="en">0</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>