Skip to main content
SpringerLink
Log in

Computing the Center of Uncertain Points on Tree Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

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 is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

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

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

  3. Agarwal, P.K., Har-Peled, S., Suri, S., Yıldız, H., Zhang, W.: Convex hulls under uncertainty. In: Proceedings of the 22nd Annual European Symposium on Algorithms (ESA), pp. 37–48 (2014)

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Averbakh, I., Berman, O.: Minimax regret \(p\)-center location on a network with demand uncertainty. Locat. Sci. 5, 247–254 (1997)

    Article  MATH  Google Scholar 

  6. Bender, M., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pp. 88–94 (2000)

  7. Bhattacharya, B., Shi, Q.: Optimal algorithms for the weighted \(p\)-center problems on the real line for small \(p\). In: Proceedings of the 10th International Workshop on Algorithms and Data Structures, pp. 529–540 (2007)

  8. Brass, P., Knauer, C., Na, H.-S., Shin, C.-S., Vigneron, A.: The aligned \(k\)-center problem. Int. J. Comput. Geom. Appl. 21, 157–178 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, D.Z., Li, Jian, Wang, H.: Efficient algorithms for one-dimensional \(k\)-center problems. arXiv:1301.7512 (2013)

  10. Cheng, R., Chen, J., Xie, X.: Cleaning uncertain data with quality guarantees. Proc. VLDB Endow. 1(1), 722–735 (2008)

    Article  Google Scholar 

  11. Cheng, R., Xia, Y., Prabhakar, S., Shah, R., Vitter, J.S.: Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), pp. 876–887 (2004)

  12. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200–208 (1987)

    Article  MathSciNet  Google Scholar 

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

  14. Dong, X., Halevy, A.Y., Yu, C.: Data integration with uncertainty. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 687–698 (2007)

  15. Foul, A.: A \(1\)-center problem on the plane with uniformly distributed demand points. Oper. Res. Lett. 34(3), 264–268 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Frederickson, G.N.: Parametric search and locating supply centers in trees. In: Proceedings of the 2nd International Workshop on Algorithms and Data Structures (WADS), pp. 299–319 (1991)

  17. Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338–355 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  18. Jørgensen, A., Löffler, M., Phillips, J.M.: Geometric computations on indecisive points. In: Proceedings of the 12nd Algorithms and Data Structures Symposium (WADS), pp. 536–547 (2011)

  19. Kamousi, P., Chan, T.M., Suri, S.: Closest pair and the post office problem for stochastic points. In: Proceedings of the 12nd International Workshop on Algorithms and Data Structures (WADS), pp. 548–559 (2011)

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

  21. Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. II: the \(p\)-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  22. Karmakar, A., Das, S., Nandy, S.C., Bhattacharya, B.K.: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2), 176–190 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Löffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. Theory Appl. 43(4), 419–433 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comut. 13, 182–196 (1984)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  27. Megiddo, N., Tamir, A., Zemel, E., Chandrasekaran, R.: An \(O(n \log ^2 n)\) algorithm for the \(k\)-th longest path in a tree with applications to location problems. SIAM J. Comput. 10, 328–337 (1981)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  29. Suri, S., Verbeek, K.: On the most likely voronoi diagram and nearest neighbor searching. In: Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), pp. 338–350 (2014)

  30. Suri, S., Verbeek, K., Yıldız, H.H.: On the most likely convex hull of uncertain points. In: Proceedings of the 21st European Symposium on Algorithms (ESA), pp. 791–802 (2013)

  31. Tao, Y., Xiao, X., Cheng, R.: Range search on multidimensional uncertain data. ACM Trans. Database Syst. 32, 15 (2007)

    Article  Google Scholar 

  32. Wang, H.: Minmax regret 1-facility location on uncertain path networks. Eur. J. Oper. Res. 239, 636–643 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  33. Wang, H., Zhang, J.: Line-constrained \(k\)-median, \(k\)-means, and \(k\)-center problems in the plane. In: Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), pp. 104–115 (2014)

  34. Wang, H., Zhang, J.: One-dimensional \(k\)-center on uncertain data. In: Proceedings of the 20th International Computing and Combinatorics Conference (COCOON), pp. 104–115 (2014)

  35. Yiu, M.L., Mamoulis, N., Dai, X., Tao, Y., Vaitis, M.: Efficient evaluation of probabilistic advanced spatial queries on existentially uncertain data. IEEE Trans. Knowl. Data Eng. 21, 108–122 (2009)

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

Additional information

A preliminary version of this paper will appear in the Proceedings of the 14th Algorithms and Data Structures Symposium (WADS 2015).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, H., Zhang, J. Computing the Center of Uncertain Points on Tree Networks. Algorithmica 78, 232–254 (2017). https://doi.org/10.1007/s00453-016-0158-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-016-0158-3

Keywords

Search

Navigation