arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.08263cs.DS
收藏

几何运输问题的快速算法

Faster Algorithms for the Geometric Transportation Problem

Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, Allen Xiao

摘要:

令$R$和$B$是$\mathbb{R}^d$中的两个点集,其中$|R|+ |B| = n$和$d$是常数。接下来,令$λ: R \cup B \to \mathbb{N}$使得$\sum_{r \in R } λ(r) = \sum_{b \in B} λ(b)$是$R$和$B$上的需求函数。令$\|\cdot\|$是合适的距离函数,例如$L_p$距离。运输问题要求找到一个映射$τ: R \times B \to \mathbb{N}$,使得$\sum_{b \in B}τ(r,b) = λ(r)$、$\sum_{r \in R}τ(r,b) = λ(b)$和$\sum_{r \in R, b \in B} τ(r,b) \|r-b\|$最小化。我们提出了三个新的结果的运输问题时,$\|r-b\|$是任何$L_p$度量:-对于任何常数$\varepsilon > 0$,$O(n^{1+\varepsilon})$预期时间随机算法,返回一个运输地图的预期成本$O(\log^2(1/\varepsilon))$倍的最佳成本。- 对于任何$\varepsilon > 0$,在$O(n^{3/2}\varepsilon^{-d} \operatorname{polylog}(U) \operatorname{polylog}(n))$时间上的$(1+\varepsilon)$ -近似,其中$U = \max_{p\in R\cup B} λ(p)$。- 一个精确强多项式$O(n^2 \operatorname{polylog}n)$时间算法,用于$d = 2$ .

英文摘要:

Let $R$ and $B$ be two point sets in $\mathbb{R}^d$, with $|R|+ |B| = n$ and where $d$ is a constant. Next, let $λ: R \cup B \to \mathbb{N}$ such that $\sum_{r \in R } λ(r) = \sum_{b \in B} λ(b)$ be demand functions over $R$ and $B$. Let $\|\cdot\|$ be a suitable distance function such as the $L_p$ distance. The transportation problem asks to find a map $τ: R \times B \to \mathbb{N}$ such that $\sum_{b \in B}τ(r,b) = λ(r)$, $\sum_{r \in R}τ(r,b) = λ(b)$, and $\sum_{r \in R, b \in B} τ(r,b) \|r-b\|$ is minimized. We present three new results for the transportation problem when $\|r-b\|$ is any $L_p$ metric: - For any constant $\varepsilon > 0$, an $O(n^{1+\varepsilon})$ expected time randomized algorithm that returns a transportation map with expected cost $O(\log^2(1/\varepsilon))$ times the optimal cost. - For any $\varepsilon > 0$, a $(1+\varepsilon)$-approximation in $O(n^{3/2}\varepsilon^{-d} \operatorname{polylog}(U) \operatorname{polylog}(n))$ time, where $U = \max_{p\in R\cup B} λ(p)$. - An exact strongly polynomial $O(n^2 \operatorname{polylog}n)$ time algorithm, for $d = 2$.

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

↑