arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.02580cs.DS
收藏

树上不确定点的双中心问题

The Two-Center Problem of Uncertain Points on Trees

Haitao Xu, Jingru Zhang

AI总结:

针对树上带概率位置的带权不确定点双中心问题,本文提出一种高效简洁算法,将通用k中心方法的复杂度降至O(|T|+mn log mn),以最小化各点到期望最近中心的最大加权期望距离。

摘要:

本文研究树上(带权)不确定点的双中心问题。给定一棵树$T$和包含$n$个(带权)不确定点的集合$\boldsymbol{\text{calP}}$,每个不确定点在$T$上有$m$个可能位置并关联概率。目标是在$T$上计算两个点(即关于$\boldsymbol{\text{calP}}$的两个中心),以最小化$n$个不确定点到其各自期望最近中心的最大(带权)期望距离。通用$k$-中心问题的算法可在$O(|T|+n^2\backslash\text{log}n\backslash\text{log}mn + mn\backslash\text{log}^2 mn \backslash\text{log}n)$时间内解决该问题。本文提出更高效简洁的算法,能在$O(|T| + mn\backslash\text{log}mn)$时间内求解。

英文摘要:

In this paper, we consider the (weighted) two-center problem of uncertain points on a tree. Given are a tree $T$ and a set $\calP$ of $n$ (weighted) uncertain points each of which has $m$ possible locations on $T$ associated with probabilities. The goal is to compute two points on $T$, i.e., two centers with respect to $\calP$, so that the maximum (weighted) expected distance of $n$ uncertain points to their own expected closest center is minimized. This problem can be solved in $O(|T|+ n^{2}\log n\log mn + mn\log^2 mn \log n)$ time by the algorithm for the general $k$-center problem. In this paper, we give a more efficient and simple algorithm that solves this problem in $O(|T| + mn\log mn)$ time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑