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

用Hamming距离向量的$p$ -范数计算质心

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Jiehua Chen, Danny Hermelin, Manuel Sorge

摘要:

在本文中,我们考虑$p$ -范数汉明质心问题,要求确定是否一些给定的二进制字符串有一个质心上的$p$ -范数的汉明距离字符串的约束。具体来说,给定一组字符串$S$和一个真正的$k$,我们考虑的问题,确定是否存在一个字符串$s^*$与$\big(\sum_{s \in S}d^p(s^*,s)\big)^{1/p} \leq k$,其中$d(,)$表示的汉明距离度量。这个问题在数据聚类中有重要的应用,并且是著名的多项式时间可解的\textsc{Consensus String} $(p=1)$问题以及NP难的\textsc{Closest String} $(p=\infty)$问题的推广。我们的主要结果表明,该问题是NP-困难的所有固定的合理$p > 1$,关闭$1$和$\infty$之间的差距$p$的所有合理值。在标准的复杂性假设下,这种简化也意味着该问题没有$2^{o(n+m)}$时间或$2^{o(k^{\frac{p}{(p+1)}})}$时间算法,其中$m$表示输入字符串的数量,$n$表示每个字符串的长度,对于任何固定的$p > 1$。两个运行时间下限都很紧。特别地,我们为每个固定的$\varepsilon > 0$提供了一个$2^{k^{\frac{p}{(p+1)}+\varepsilon}}$时间算法。在文章的最后部分,我们通过给出一个固定参数算法和一个因子- $2$近似算法来补充我们的硬度结果。

英文摘要:

In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of strings $S$ and a real $k$, we consider the problem of determining whether there exists a string $s^*$ with $\big(\sum_{s \in S}d^p(s^*,s)\big)^{1/p} \leq k$, where $d(,)$ denotes the Hamming distance metric. This problem has important applications in data clustering, and is a generalization of the well-known polynomial-time solvable \textsc{Consensus String} $(p=1)$ problem, as well as the NP-hard \textsc{Closest String} $(p=\infty)$ problem. Our main result shows that the problem is NP-hard for all fixed rational $p > 1$, closing the gap for all rational values of $p$ between $1$ and $\infty$. Under standard complexity assumptions the reduction also implies that the problem has no $2^{o(n+m)}$-time or $2^{o(k^{\frac{p}{(p+1)}})}$-time algorithm, where $m$ denotes the number of input strings and $n$ denotes the length of each string, for any fixed $p > 1$. Both running time lower bounds are tight. In particular, we provide a $2^{k^{\frac{p}{(p+1)}+\varepsilon}}$-time algorithm for each fixed $\varepsilon > 0$. In the last part of the paper, we complement our hardness result by presenting a fixed-parameter algorithm and a factor-$2$ approximation algorithm for the problem.

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

↑