Computing the Center of Uncertain Points on Tree Networks

@article{Wang2016ComputingTC,
  title={Computing the Center of Uncertain Points on Tree Networks},
  author={Haitao Wang and Jingru Zhang},
  journal={Algorithmica},
  year={2016},
  volume={78},
  pages={232-254}
}
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^*$$x∗ on T such that the maximum (weighted) expected distance from $$x^*$$x∗ to all uncertain points is minimized. To the best of our knowledge, this problem has not been… CONTINUE READING

Figures and Topics from this paper.

References

Publications referenced by this paper.