Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 2015: Algorithms and Data Structures pp 606–618Cite as

Computing the Center of Uncertain Points on Tree Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9214))

Abstract

Uncertain data has been very common in many applications. In this paper, we consider the one-center problem for uncertain data on tree networks. In this problem, we are given a tree T and n (weighted) uncertain points each of which has m possible locations on T associated with probabilities. The goal is to find a point \(x^*\) on T such that the maximum (weighted) expected distance from \(x^*\) to all uncertain points is minimized. To the best of our knowledge, this problem has not been studied before. We propose a refined prune-and-search technique that solves the problem in linear time.

This research was supported in part by NSF under Grant CCF-1317143.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P., Cheng, S.W., Tao, Y., Yi, K.: Indexing uncertain data. In: Proc. of the 28th Symposium on Principles of Database Systems (PODS), pp. 137–146 (2009)

    Google Scholar 

  2. Agarwal, P., Efrat, A., Sankararaman, S., Zhang, W.: Nearest-neighbor searching under uncertainty. In: Proc. of the 31st Symposium on Principles of Database Systems (PODS), pp. 225–236 (2012)

    Google Scholar 

  3. Agarwal, P.K., Har-Peled, S., Suri, S., Yıldız, H., Zhang, W.: Convex hulls under uncertainty. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 37–48. Springer, Heidelberg (2014)

    Google Scholar 

  4. Averbakh, I., Bereg, S.: Facility location problems with uncertainty on the plane. Discrete Optimization 2, 3–34 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic 2-centers in the black-box model. In: Proc. of the 29th Annual Symposium on Computational Geometry (SoCG), pp. 145–154 (2013)

    Google Scholar 

  6. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM 34(1), 200–208 (1987)

    Article  Google Scholar 

  7. Foul, A.: A \(1\)-center problem on the plane with uniformly distributed demand points. Operations Research Letters 34(3), 264–268 (2006)

    Article  MathSciNet  Google Scholar 

  8. Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 299–319. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  9. Jørgensen, A., Löffler, M., Phillips, J.M.: Geometric computations on indecisive points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 536–547. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Kamousi, P., Chan, T.M., Suri, S.: Closest pair and the post office problem for stochastic points. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 548–559. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Kamousi, P., Chan, T., Suri, S.: Stochastic minimum spanning trees in euclidean spaces. In: Proc. of the 27th Annual Symposium on Computational Geometry (SoCG), pp. 65–74 (2011)

    Google Scholar 

  12. Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. II: The \(p\)-medians. SIAM Journal on Applied Mathematics 37(3), 539–560 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  13. Löffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Computational Geometry: Theory and Applications 43(4), 419–433 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Megiddo, N.: Linear-time algorithms for linear programming in \(R^3\) and related problems. SIAM Journal on Computing 12(4), 759–776 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM Journal on Comuting 13, 182–196 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  16. Megiddo, N., Tamir, A.: New results on the complexity of \(p\)-centre problems. SIAM Journal on Computing 12(4), 751–758 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  17. Megiddo, N., Zemel, E.: An \(O(n \log n)\) randomizing algorithm for the weighted Euclidean 1-center problem. Journal of Algorithms 7, 358–368 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  18. Suri, S., Verbeek, K.: On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 338–350. Springer, Heidelberg (2014)

    Google Scholar 

  19. Suri, S., Verbeek, K., Yıldız, H.: On the Most Likely Convex Hull of Uncertain Points. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 791–802. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  20. Wang, H.: Minmax regret 1-facility location on uncertain path networks. European Journal of Operational Research 239, 636–643 (2014)

    Article  MathSciNet  Google Scholar 

  21. Wang, H., Zhang, J.: One-dimensional k-center on uncertain data. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 104–115. Springer, Heidelberg (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utah State University, Logan, UT, 84322, USA

    Haitao Wang & Jingru Zhang

Authors
  1. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingru Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jingru Zhang .

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Carleton University, Ottawa, Canada

    Jörg-Rüdiger Sack

  3. University of Victoria, Victoria, Canada

    Ulrike Stege

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, H., Zhang, J. (2015). Computing the Center of Uncertain Points on Tree Networks. In: Dehne, F., Sack, JR., Stege, U. (eds) Algorithms and Data Structures. WADS 2015. Lecture Notes in Computer Science(), vol 9214. Springer, Cham. https://doi.org/10.1007/978-3-319-21840-3_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21840-3_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21839-7

  • Online ISBN: 978-3-319-21840-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation