科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider the one-dimensional one-center problem on uncertain data. We are given a set P of n (weighted) uncertain points on a real line L and each uncertain point is specified by a probability density function that is a piecewise-uniform i.e., a histogram). The goal is to find a point c (the center) on L such that the maximum expected distance from c to all uncertain points of P is minimized. We present a linear-time algorithm for this problem.
- 出版日期2016-5
