<?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-22T17:23:11Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/12413" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/12413</identifier><datestamp>2025-03-26T23:34: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">Sanità, Laura</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="6d05c754-5e97-4ceb-85bf-c11882f47787" confidence="600">Kafer, Sean</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-09-20T19:24:18Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-09-20T19:24:18Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-09-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/12413</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P is defined as the maximum value of a shortest path between two vertices of P, where the path uses potential edge directions of P i.e., all edge directions that can arise by translating some of the facets of P .&#xd;
In this thesis, we study the circuit diameter of polytopes corresponding to classical combinatorial optimization problems, such as the Matching polytope, the Traveling Sales- man polytope and the Fractional Stable Set polytope. We also introduce the notion of the circuit diameter of a formulation of a polytope P. In this setting the circuits are determined from some external linear system describing P which may not be minimal with respect to its constraints. We use this notion to generalize other results of this thesis, as well as introduce new results about a formulation of the Spanning Tree polytope and a formulation of the Matroid polytope.</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">Circuit Diameter</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Hirsch Conjecture</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Circuit Hirsch Conjecture</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Traveling Salesman Polytope</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Matching Polytope</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Perfect Matching Polytope</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polytope Formulations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Fractional Stable Set Polytope</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Combinatorial Diameter</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Spanning Tree Polytope</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Matroid Polytope</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">On The Circuit Diameters of Some Combinatorial Polytopes</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">Sanità, Laura</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>