Back to Results
First PageMeta Content
Computational complexity theory / Computational geometry / Linear programming / Analysis of algorithms / LP-type problem / Algorithm / Time complexity / Streaming algorithm / Minimum bounding box algorithms / Theoretical computer science / Applied mathematics / Mathematics


CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract
Add to Reading List

Document Date: 2008-10-27 22:59:03


Open Document

File Size: 401,66 KB

Share Result on Facebook

City

Las Vegas / Kingston / Waterloo / /

Company

BOC / /

Country

Canada / /

Currency

USD / /

/

Facility

University of Waterloo / /

IndustryTerm

simplest algorithm / elegant algorithm / trivial 2approximation streaming algorithm / n¨aive 2approximation algorithm / approximation algorithm / pass algorithm / linear-time deterministic algorithms / streaming algorithms / deterministic algorithm / on-line algorithm / streaming algorithm / faster approximation algorithms / diameter algorithm / restricted on-line version / /

Organization

School of Computer Science / University of Waterloo / /

Person

Timothy M. Chan / /

ProvinceOrState

Alberta / Ontario / /

PublishedMedium

Journal of the ACM / /

Technology

one-pass algorithm / n¨aive 2approximation algorithm / pass algorithm / Las Vegas algorithms / elegant algorithm / linear-time deterministic algorithms / approximation algorithm / deterministic algorithm / on-line algorithm / three-pass algorithm / faster approximation algorithms / J. Algorithms / one-pass algorithms / one-pass streaming algorithm / two-pass diameter algorithm / trivial 2-approximation algorithm / same algorithm / streaming algorithm / trivial 2approximation streaming algorithm / simplest algorithm / two-pass algorithm / /

URL

http /

SocialTag