关于相关聚类的不可近似性的一个注记
A Note on the Inapproximability of Correlation Clustering
摘要:
我们考虑相关聚类问题的不可近似性,定义如下:给定一个图$G = (V,E)$,其中每个边被标记为“+”(相似)或“-”(不相似),相关聚类试图将顶点划分为簇,以便正确地(分别)确定对的数量。不正确地)被最大化(相应地,最小化)。这两个互补的问题分别被称为MaxAgree和MinDisagree,并且已经在完全图上进行了研究,其中每个边都被标记,而一般图中某些边可能没有被标记。这两个问题的自然边加权版本也进行了研究。令S-MaxAgree表示所有权取自集合S的加权问题,我们证明了S-MaxAgree与$O(|V|^{1/2-δ})$的权在以下意义下本质上属于同一硬度类:如果存在多项式时间算法,其以高概率在因子$λ= O(\log{|V|})$内近似S-MaxAgree,则对于S '的任何选择,S ′-MaxAgree可以在多项式时间内在因子$(λ+ ε)$内近似,其中$ε> 0$可以是任意小的,具有高概率。Charikar等人的$S-MinDisagree. This result implies it is hard (assuming $ NP \neq RP $) to approximate unweighted MaxAgree within a factor of $ 80/79-ε $, improving upon a previous known factor of $ 116/115-ε$也有类似的陈述。\cite{Chari05} .
英文摘要:
We consider inapproximability of the correlation clustering problem defined as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+" (similar) or "-" (dissimilar), correlation clustering seeks to partition the vertices into clusters so that the number of pairs correctly (resp. incorrectly) classified with respect to the labels is maximized (resp. minimized). The two complementary problems are called MaxAgree and MinDisagree, respectively, and have been studied on complete graphs, where every edge is labeled, and general graphs, where some edge might not have been labeled. Natural edge-weighted versions of both problems have been studied as well. Let S-MaxAgree denote the weighted problem where all weights are taken from set S, we show that S-MaxAgree with weights bounded by $O(|V|^{1/2-δ})$ essentially belongs to the same hardness class in the following sense: if there is a polynomial time algorithm that approximates S-MaxAgree within a factor of $λ= O(\log{|V|})$ with high probability, then for any choice of S', S'-MaxAgree can be approximated in polynomial time within a factor of $(λ+ ε)$, where $ε> 0$ can be arbitrarily small, with high probability. A similar statement also holds for $S-MinDisagree. This result implies it is hard (assuming $NP \neq RP$) to approximate unweighted MaxAgree within a factor of $80/79-ε$, improving upon a previous known factor of $116/115-ε$ by Charikar et. al. \cite{Chari05}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。