图上最小单峰分解是NP困难的
Minimal Unimodal Decomposition is NP-Hard on Graphs
AI总结:
该研究证明在图上寻找边线性函数的最小单峰分解是NP困难的,并扩展至任意k个单峰函数、平面图、不可近似性及高维情形。
摘要:
拓扑空间上的函数若其所有上水平集都是可缩的,则称为单峰函数。函数$f$的最小单峰分解是求和为$f$的单峰函数的最小数目。将给定密度函数分解为其最小单峰分量的问题在拓扑统计学中具有基础性意义。我们证明,在图上的边线性函数上寻找最小单峰分解是NP困难的。给定任意$k \geq 2$,我们确立了寻找由$k$个单峰函数组成的单峰分解的NP困难性。我们还将NP困难性结果扩展到问题的相关变体,包括限制到平面图、不可近似性结果以及向更高维度的推广。
英文摘要:
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of decomposing a given density function into its minimal unimodal components is fundamental in topological statistics. We show that finding a minimal unimodal decomposition of an edge-linear function on a graph is NP-hard. Given any $k \geq 2$, we establish the NP-hardness of finding a unimodal decomposition consisting of $k$ unimodal functions. We also extend the NP-hardness result to related variants of the problem, including restriction to planar graphs, inapproximability results, and generalizations to higher dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。