TY - GEN

T1 - Closest pair and the post office problem for stochastic points

AU - Kamousi, Pegah

AU - Chan, Timothy M.

AU - Suri, Subhash

N1 - Funding Information:
The work of the first and the third author was supported in part by National Science Foundation grants CCF-0514738 and CNS-1035917 . The work of the second author was supported by NSERC . A preliminary version of the paper has appeared in: Proc. 12th Algorithms and Data Structures Symposium (WADS), 2011, pp. 548–559.
Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80052124640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052124640&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22300-6_46

DO - 10.1007/978-3-642-22300-6_46

M3 - Conference contribution

AN - SCOPUS:80052124640

SN - 9783642222993

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 548

EP - 559

BT - Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings

T2 - 12th International Symposium on Algorithms and Data Structures, WADS 2011

Y2 - 15 August 2011 through 17 August 2011

ER -