Improved Bounds for Rectangular Monotone Min-Plus Product
Improved Bounds for Rectangular Monotone Min-Plus Product
复制标题
矩形单调最小加乘积的改进界限
DOI:
--
复制
发表时间:
2022
影响因子:
0.5
通讯作者:
Anita Dürr
中科院分区:
文献类型:
--
作者:
Anita Dürr
In a recent breakthrough paper, Chi et al. (STOC'22) introduce an $\tilde{O}(n^{\frac{3 + \omega}{2}})$ time algorithm to compute Monotone Min-Plus Product between two square matrices of dimensions $n \times n$ and entries bounded by $O(n)$. This greatly improves upon the previous $\tilde O(n^{\frac{12 + \omega}{5}})$ time algorithm and as a consequence improves bounds for its applications. Several other applications involve Monotone Min-Plus Product between rectangular matrices, and even if Chi et al.'s algorithm seems applicable for the rectangular case, the generalization is not straightforward. In this paper we present a generalization of the algorithm of Chi et al. to solve Monotone Min-Plus Product for rectangular matrices with polynomial bounded values. We next use this faster algorithm to improve running times for the following applications of Rectangular Monotone Min-Plus Product: $M$-bounded Single Source Replacement Path, Batch Range Mode, $k$-Dyck Edit Distance and 2-approximation of All Pairs Shortest Path. We also improve the running time for Unweighted Tree Edit Distance using the algorithm by Chi et al.
DOI:
--
发表时间:
2021
期刊:
and Programming (ICALP 2021
影响因子:
--
作者:
Gu, Yuzhou;Polak, Adam;Vassilevska Williams, Virginia;Xu, Yinzhan
通讯作者:
Xu, Yinzhan
影响因子:
1.3
作者:
Grandoni, Fabrizio;Williams, Virginia Vassilevska
通讯作者:
Williams, Virginia Vassilevska
DOI:
--
发表时间:
2022
期刊:
and Programming (ICALP 2022
影响因子:
--
作者:
Deng, Mingyang;Kirkpatrick, Yael;Rong, Victor;Vassilevska Williams, Virginia;Zhong, Ziqian
通讯作者:
Zhong, Ziqian