<?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-22T18:21:09Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6172" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6172</identifier><datestamp>2017-03-21T18:27:11Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</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="7dd4517d-4125-4b11-af0f-62d48594ac83" confidence="600">Pathak, Vinayak</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2011-08-30T18:06:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-08-30T18:06:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2011-08-30T18:06:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011-08-23</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6172</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">At SODA&amp;apos;10, Agarwal and Sharathkumar presented a streaming&#xd;
algorithm for approximating the minimum enclosing ball of&#xd;
a set of points in d-dimensional Euclidean space.  Their&#xd;
algorithm requires one pass, uses O(d) space, and &#xd;
was shown to have approximation&#xd;
factor at most 1.3661.&#xd;
We prove that the same algorithm has&#xd;
approximation factor less than 1.22, which brings us&#xd;
much closer to a 1.207 lower bound given&#xd;
by Agarwal and Sharathkumar.  &#xd;
&#xd;
We also apply this technique to the dynamic version of &#xd;
the minimum enclosing ball problem (in the non-streaming setting). &#xd;
We give an O(dn)-space data structure that can maintain &#xd;
a 1.22-approximate&#xd;
minimum enclosing ball in O(dlog n) expected amortized time &#xd;
per insertion/deletion.&#xd;
&#xd;
Finally, we prove that a 1+ϵ approximation to the problem can be found in (0.5+δ)/ϵ passes over the input, for an arbitrarily small constant δ, which is an improvement over the previous result that used 2/ϵ passes.</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">computational-geometry</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions</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">School of Computer Science</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>