On Approximability of $\ell_2^2$ Min-Sum Clustering
Rutgers University(罗格斯大学);University of Michigan(密歇根大学);The Hebrew University of Jerusalem(耶路撒冷希伯来大学);Aarhus University(奥胡斯大学);Texas A&M University(德克萨斯农工大学)
Karthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, Samson Zhou
The $\ell_2^2$ min-sum $k$-clustering problem is to partition an input set into clusters $C_1,\ldots,C_k$ to minimize $\sum_{i=1}^k\sum_{p,q\in C_i}\|p-q\|_2^2$. Although $\ell_2^2$ min-sum $k$-clustering is NP-hard, it is not known whether it is NP-hard to approximate $\ell_2^2$ min-sum $k$-clustering beyond a certain factor.
In this paper, we give the first hardness-of-approximation result for the $\ell_2^2$ min-sum $k$-clustering problem. We show that it is NP-hard to approximate the objective to a factor better than $1.056$ and moreover, assuming a balanced variant of the Johnson Coverage Hypothesis, it is NP-hard to approximate the objective to a factor better than 1.327.
We then complement our hardness result by giving a nearly linear time parameterized PTAS for $\ell_2^2$ min-sum $k$-clustering running in time $O\left(n^{1+o(1)}d\cdot \exp((k\cdot\varepsilon^{-1})^{O(1)})\right)$, where $d$ is the underlying dimension of the input dataset.
Finally, we consider a learning-augmented setting, where the algorithm has access to an oracle that outputs a label $i\in[k]$ for input point, thereby implicitly partitioning the input dataset into $k$ clusters that induce an approximately optimal solution, up to some amount of adversarial error $α\in\left[0,\frac{1}{2}\right)$. We give a polynomial-time algorithm that outputs a $\frac{1+γα}{(1-α)^2}$-approximation to $\ell_2^2$ min-sum $k$-clustering, for a fixed constant $γ>0$.
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set
我们发现,计算杂交数的两个有根二元系统发生树在同一组的类群X的问题有一个常数因子多项式时间近似的当且仅当计算一个最小尺寸的反馈顶点集在一个有向图(DFVS)的问题有一个常数因子多项式时间近似。后一个问题,要求从有向图中移除最少数量的顶点以将其转换为有向无圈图,是卡普1972年开创性的21个NP完全问题列表中的问题之一。然而,尽管组合优化社区相当关注,但直到今天仍不知道DFVS是否存在常数因子多项式时间近似。因此,我们的结果将(在)近似的杂交数在一个更广泛的复杂性的背景下,因此,我们得到的杂交数继承的不可近似的结果,从问题的顶点覆盖。在积极的一面,我们使用的DFVS文献的结果给出了O(log r log log r)近似的杂交数,其中r是一个最优解的杂交数问题的值。