Closest pair and the post office problem for stochastic points

Pegah Kamousi, Timothy M. Chan, Subhash Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point mi ∈ M with an independent probability pi. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, what is the probability that the distance between the closest pair of points in the random subset is no more than ℓ, for a given value ℓ? Or, can we preprocess the master set M such that given a query point q, we can efficiently estimate the expected distance from q to its nearest neighbor in the random subset? We obtain hardness results and approximation algorithms for stochastic problems of this kind.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings
Pages548-559
Number of pages12
DOIs
StatePublished - 2011
Externally publishedYes
Event12th International Symposium on Algorithms and Data Structures, WADS 2011 - New York, NY, United States
Duration: Aug 15 2011Aug 17 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6844 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Algorithms and Data Structures, WADS 2011
CountryUnited States
CityNew York, NY
Period8/15/118/17/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Closest pair and the post office problem for stochastic points'. Together they form a unique fingerprint.

Cite this