<?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-22T08:13:58Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5239" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5239</identifier><datestamp>2017-03-21T18:55:13Z</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="author" authority="5429c484-309f-496b-aa08-70e3e6c0aa6f" confidence="600">Shea, Marcus</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-05-21T19:46:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-05-21T19:46:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-05-21T19:46:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5239</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Iterative rounding has been an increasingly popular approach to solving network design optimization problems ever since Jain introduced the concept in his revolutionary 2-approximation for the Survivable Network Design Problem (SNDP). This paper looks at several important iterative rounding approximation algorithms and makes improvements to some of their proofs. We generalize a matrix restatement of Nagarajan et al.&amp;apos;s token argument, which we can use to simplify the proofs of Jain&amp;apos;s 2-approximation for SNDP and Fleischer et al.&amp;apos;s 2-approximation for the Element Connectivity (ELC) problem. Lau et al. show how one can construct a (2,2B + 3)-approximation for the degree bounded ELC problem, and this thesis provides the proof. We provide some structural results for basic feasible solutions of the Prize-Collecting Steiner Tree problem, and introduce a new problem that arises, which we call the Prize-Collecting Generalized Steiner Tree problem.</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">iterative rounding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximation algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">network design</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">degree bounded</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">prize collecting</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">fractional tokens</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Iterative Rounding Approximation Algorithms in Network Design</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">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" lang="en">Master of Mathematics</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>