<?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-22T13:14:59Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9396" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9396</identifier><datestamp>2017-03-21T14:44:38Z</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="514a272b-fd4e-43bb-a1a3-dc06989581f2" confidence="600">Lange, Alexander</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-05-22T18:33:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-05-22T18:33:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-05-22</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9396</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study a budgeted cut problem known as Graph Protection, where&#xd;
the goal is to remove edges of a given graph in order to protect&#xd;
valuable nodes from stochastic, infectious threats. This problem was&#xd;
recently proposed by Shmoys and Spencer to model challenges associated&#xd;
with wildfire prevention when resources are limited and only&#xd;
probabilistic data of ignition location is known. The input consists of&#xd;
a graph with node values and edge costs, a budget, and probabilistic&#xd;
data signifying the likelihood a set of nodes will ignite; the goal&#xd;
is to remove a set of edges with total cost at most the budget so as&#xd;
to maximize the expected protected value unreachable from these&#xd;
stochastic ignition scenarios.&#xd;
&#xd;
Our focus is on the design of approximation algorithms for Graph&#xd;
Protection when an ignition scenario can contain an arbitrary number&#xd;
of nodes, a setting mostly left open in the literature. Our main&#xd;
positive result is the design of constant-factor approximation&#xd;
algorithms for Graph Protection when the input graph is a tree&#xd;
and each node has an independent chance of being an ignition point. We&#xd;
also show that in the general case when ignition probabilities are&#xd;
defined by a distribution over subsets of nodes, the problem becomes&#xd;
at least as hard as the Densest k-Subgraph problem and thus,&#xd;
such an approximation algorithm is unlikely to exist.</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">graph protection</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">Approximation Algorithms for Graph Protection 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" 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>