<?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-22T16:11:56Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/8511" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/8511</identifier><datestamp>2017-03-21T14:08:31Z</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="2544261d-0a28-4f00-8c98-9f996062be01" confidence="600">Shadravan, Mohammad</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-05-27T15:35:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-05-27T15:35:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2014-05-27</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2014</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/8511</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In the Directed Steiner Tree problem, we are given a directed graph G = (V,E) with edge costs, a root vertex r ∈ V, and a terminal set X ⊆ V . The goal is to find the cheapest subset of edges that contains an r-t path for every terminal t ∈ X. The only known polylogarithmic approximations for Directed Steiner Tree run in quasi-polynomial time and the best polynomial time approximations only achieve a guarantee of O(|X|^ε) for any constant ε &amp;gt; 0. Furthermore, the integrality gap of a natural LP relaxation can be as bad as Ω(√|X|).&#xd;
￼&#xd;
We demonstrate that l rounds of the Sherali-Adams hierarchy suffice to reduce the integrality gap of a natural LP relaxation for Directed Steiner Tree in l-layered graphs from Ω( k) to O(l · log k) where k is the number of terminals. ￼This is an improvement over Rothvoss’ result that 2l rounds of the considerably stronger Lasserre SDP hierarchy reduce the integrality gap of a similar formulation to O(l · log k).&#xd;
&#xd;
We also observe that Directed Steiner Tree instances with 3 layers of edges have only an O(logk) integrality gap bound in the standard LP relaxation, ￼complementing the fact that the gap can be as large as Ω(√k) in graphs with 4 layers.&#xd;
&#xd;
Finally, we consider quasi-bipartite instances of Directed Steiner Tree meaning no edge in E connects two Steiner nodes V − (X ∪ {r}). By a simple reduction from Set Cover, it is still NP-hard to approximate quasi-bipartite instances within a ratio better than O(log|X|). We present a polynomial-time O(log |X|)-approximation for quasi-bipartite instances of Directed Steiner Tree. Our approach also bounds the integrality gap of the natural LP relaxation by the same quantity. A novel feature of our algorithm is that it is based on the primal-dual framework, which typically does not result in good approximations for network design problems in directed graphs.</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">directed Steiner tree</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximation algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">lift and project methods</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">On the Integrality Gap of Directed Steiner Tree Problem</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>