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

最小莫尔斯:可逼近性及应用

Min Morse: Approximability & Applications

Abhishek Rathore

摘要:

本文解决了Joswig等人提出的一个公开问题,给出了求解最小Morse不匹配问题(MMUP)的一个$\tilde{O}(N)$时间、$O(\log^2(N))$因子近似算法。设$Λ$为最优离散Morse函数的临界单元数,$N$为正则单元复形K的总单元数。MMUP的目标是找到给定复形K的$Λ$。首先,我们应用一个近似。在MMUP上保持图约简,得到一个新的问题,即最小偏序问题(min-POP)(min-feedback arc set problem的严格推广).减少涉及刚性边缘,这是边缘,要求严格包括在输出解决方案的介绍。为了解决最小POP,我们使用莱顿-拉奥分而治之的范例,提供解决方案的SDP制定的最小定向平衡切割与刚性边缘(最小DBCRE)的情况下。我们的第一个算法最小DBCRE扩展Agarwal等人。的舍入程序的有向图制定的ARV算法处理刚性边缘。我们的第二个算法来解决最小DBCRE SDP,适应阿罗拉等人。的原始对偶MWUM。在应用方面,在拓扑特征的大小明显小于复形的大小的温和假设下,我们得到了计算单纯复形K(其中A是任意阿贝尔群)的同调群$H_i(K,A)$的(a)$\tilde{O}(N)$算法. (b)一个用于计算持久同源性的$\tilde{O}(N^2)$算法和(c)一个用于计算与输入标量函数相容的最佳离散Morse-Witten函数的$\tilde{O}(N)$算法,作为我们的MMUP的近似算法的简单结果,从而在上述假设下为这些应用中的每一个给出了最佳已知的复杂性界限。这样的假设在应用环境中是现实的,并且通常是现代大规模数据集的特征。

英文摘要:

We resolve an open problem posed by Joswig et al. by providing an $\tilde{O}(N)$ time, $O(\log^2(N))$-factor approximation algorithm for the min-Morse unmatched problem (MMUP) Let $Λ$ be the no. of critical cells of the optimal discrete Morse function and $N$ be the total no. of cells of a regular cell complex K. The goal of MMUP is to find $Λ$ for a given complex K. To begin with, we apply an approx. preserving graph reduction on MMUP to obtain a new problem namely the min-partial order problem (min-POP)(a strict generalization of the min-feedback arc set problem). The reduction involves introduction of rigid edges which are edges that demand strict inclusion in output solution. To solve min-POP, we use the Leighton- Rao divide-&-conquer paradigm that provides solutions to SDP-formulated instances of min-directed balanced cut with rigid edges (min-DBCRE). Our first algorithm for min-DBCRE extends Agarwal et al.'s rounding procedure for digraph formulation of ARV-algorithm to handle rigid edges. Our second algorithm to solve min-DBCRE SDP, adapts Arora et al.'s primal dual MWUM. In terms of applications, under the mild assumption1 of the size of topological features being significantly smaller compared to the size of the complex, we obtain an (a) $\tilde{O}(N)$ algorithm for computing homology groups $H_i(K,A)$ of a simplicial complex K, (where A is an arbitrary Abelian group.) (b) an $\tilde{O}(N^2)$ algorithm for computing persistent homology and (c) an $\tilde{O}(N)$ algorithm for computing the optimal discrete Morse-Witten function compatible with input scalar function as simple consequences of our approximation algorithm for MMUP thereby giving us the best known complexity bounds for each of these applications under the aforementioned assumption. Such an assumption is realistic in applied settings, and often a characteristic of modern massive datasets.

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

↑