<?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-22T00:12:04Z</responseDate><request verb="GetRecord" identifier="oai:digital.lib.washington.edu:1773/51140" metadataPrefix="dim">https://digital.lib.washington.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:digital.lib.washington.edu:1773/51140</identifier><datestamp>2026-02-16T02:07:40Z</datestamp><setSpec>com_1773_4888</setSpec><setSpec>col_1773_4909</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Karlin, Anna</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Oveis Gharan, Shayan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="38e36fdc-87ac-4e7b-88eb-866f2f91e501" confidence="300">Klein, Nathan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-02-12T23:40:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-02-12T23:40:05Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-02-12</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">Klein_washington_0250E_26289.pdf</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1773/51140</dim:field>
   <dim:field mdschema="dc" element="description">Thesis (Ph.D.)--University of Washington, 2023</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">This dissertation demonstrates that there is an approximation algorithm for the metric traveling salesperson problem (TSP) with approximation ratio below 3/2. This represents the first improvement in nearly half a century, answering a long-standing open problem in combinatorial optimization. The algorithm we analyze, a variant of Christofides' 3/2 approximation from the 1970s, exploits a distribution over spanning trees that has as much entropy as possible subject to obeying certain marginal constraints. A key component of this work is to show that despite the inherent unpredictability of such a distribution, the trees it produces nevertheless exhibit surprisingly robust structural properties. To show these properties, we use that the generating polynomials of these distributions have a zero-free region in the complex plane, allowing us to employ a suite of tools coming from work on the geometry of polynomials. As a byproduct of our analysis, we prove several new statements that sharply characterize the behavior of such distributions. We also discuss several other results in network design, including a lower bound for this algorithm, an optimal rounding algorithm for a special case of TSP, and improved algorithms for the $k$-edge-connected multi-subgraph problem and the laminar thin tree problem.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en_US</dim:field>
   <dim:field mdschema="dc" element="rights">none</dim:field>
   <dim:field mdschema="dc" element="subject">Approximation algorithms</dim:field>
   <dim:field mdschema="dc" element="subject">Combinatorial optimization</dim:field>
   <dim:field mdschema="dc" element="subject">Graph theory</dim:field>
   <dim:field mdschema="dc" element="subject">Strongly Rayleigh distributions</dim:field>
   <dim:field mdschema="dc" element="subject">Traveling salesperson problem</dim:field>
   <dim:field mdschema="dc" element="subject">Computer science</dim:field>
   <dim:field mdschema="dc" element="subject">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="other">Computer science and engineering</dim:field>
   <dim:field mdschema="dc" element="title">Finding Structure in Entropy: Improved Approximation Algorithms for TSP and other Graph Problems</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="embargo" qualifier="terms">Open Access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>