Closest pair and the post office problem for stochastic points

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

Volumn 6844 LNCS, Issue , 2011, Pages 548-559

  Kamousi, Pegah ^a   Chan, Timothy M ^b   Suri, Subhash ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ELEMENTARY STATISTICS; EUCLIDEAN SPACES; EXPECTED DISTANCE; HARDNESS RESULT; NEAREST NEIGHBORS; PREPROCESS; QUERY POINTS; RANDOM SUBSETS; STOCHASTIC PROBLEMS; POST-OFFICE PROBLEMS;

DATA STRUCTURES; SET THEORY; STOCHASTIC SYSTEMS; NEAREST NEIGHBOR SEARCH;

APPROXIMATION ALGORITHMS;

EID: 80052124640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22300-6_46     Document Type: Conference Paper

References (19)

1. Afshani, P., Agarwal, P.K., Arge, L., Larsen, K.G., Phillips, J.M.: (Approximate) uncertain skylines. In: ICDT, pp. 186-196 (2011)
2. Agarwal, P.K., Cheng, S.-W., Tao, Y., Yi, K.: Indexing uncertain data. In: PODS, pp. 137-146 (2009)
3. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45, 891-923 (1998)
4. Chan, T.M.: Approximate Nearest Neighbor Queries Revisited. Discrete and Computational Geometry 20, 359-373 (1998)
5. Chan, T.M.: Closest-point problems simplified on the RAM. In: Proc. SODA, pp. 472-473 (2002)
6. Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46, 178-189 (2003)
7. De Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry: algorithms and applications. Springer, Heidelberg (2008)
8. Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal on Applied Mathematics 32(4), 826-834 (1977)
9. Hardy, G.H., Polya, G., Littlewood, J.E.: Inequalities. Cambridge Press, New York (1952)
10. Kamousi, P., Chan, T., Suri, S.: Stochastic Minimum Spanning Trees in Euclidean Spaces. In: Proc. SoCG (2011) (to appear)
11. Klain, D.A., Rota, G.: Introduction to Geometric Probability, Cambridge (1997)
12. Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading (1973)
13. Lin, M.-S., Chen, Y.-J.: Counting the number of vertex covers in a trapezoid graph. Inf. Process. Lett. 109, 1187-1192 (2009)
14. Löffler, M., van Kreveld, M.J.: Largest and Smallest Convex Hulls for Imprecise Points. Algorithmica 56(2), 235-269 (2010)
15. Provan, J.S., Ball, M.O.: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM J. Comput. 12(4), 777-788 (1983)
16. Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31, 398-427 (1997)
17. Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Trans. Computers 30, 135-140 (1981)
18. Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8(3), 410-421 (1979)
19. van Kreveld, M.J., Löffler, M., Mitchell, J.S.B.: Preprocessing Imprecise Points and Splitting Triangulations. SIAM J. Comput. 39(7), 2990-3000 (2010)