Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions

dc.contributor.authorPathak, Vinayak
dc.date.accessioned2011-08-30T18:06:11Z
dc.date.available2011-08-30T18:06:11Z
dc.date.issued2011-08-30T18:06:11Z
dc.date.submitted2011-08-23
dc.description.abstractAt SODA'10, Agarwal and Sharathkumar presented a streaming algorithm for approximating the minimum enclosing ball of a set of points in d-dimensional Euclidean space. Their algorithm requires one pass, uses O(d) space, and was shown to have approximation factor at most 1.3661. We prove that the same algorithm has approximation factor less than 1.22, which brings us much closer to a 1.207 lower bound given by Agarwal and Sharathkumar. We also apply this technique to the dynamic version of the minimum enclosing ball problem (in the non-streaming setting). We give an O(dn)-space data structure that can maintain a 1.22-approximate minimum enclosing ball in O(dlog n) expected amortized time per insertion/deletion. 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.en
dc.identifier.urihttp://hdl.handle.net/10012/6172
dc.language.isoenen
dc.pendingfalseen
dc.publisherUniversity of Waterlooen
dc.subjectcomputational-geometryen
dc.subject.programComputer Scienceen
dc.titleStreaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensionsen
dc.typeMaster Thesisen
uws-etd.degreeMaster of Mathematicsen
uws-etd.degree.departmentSchool of Computer Scienceen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Pathak_Vinayak.pdf
Size:
395.38 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
253 B
Format:
Item-specific license agreed upon to submission
Description: