2026-07-20T05:31:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2885 2024-03-06T10:33:41Z ddc:004 open_access

Quasi-Random PCP and Hardness of 2-Catalog Segmentation Saket, Rishi Hardness of Approximation PCPs Catalog Segmentation We study the problem of 2-Catalog Segmentation which is one of the several variants of segmentation problems, introduced by Kleinberg et al., that naturally arise in data mining applications. Formally, given a bipartite graph $G = (U, V, E)$ and parameter $r$, the goal is to output two subsets $V_1, V_2 subseteq V$, each of size $r$, to maximize, $sum_{u \in U} max {|E(u, V_1)|, |E(u, V_2)|},$ where $E(u, V_i)$ is the set of edges between $u$ and the vertices in $V_i$ for $i = 1, 2$. There is a simple 2-approximation for this problem, and stronger approximation factors are known for the special case when $r = |V|/2$. On the other hand, it is known to be NP-hard, and Feige showed a constant factor hardness based on an assumption of average case hardness of random 3SAT. In this paper we show that there is no PTAS for $2$-Catalog Segmentation assuming that NP does not have subexponential time probabilistic algorithms, i.e. NP $\not\subseteq \cap_{\eps > 0}$ BPTIME($2^{n^\eps}$). In order to prove our result we strengthen the analysis of the Quasi-Random PCP of Khot, which we transform into an instance of $2$-Catalog Segmentation. Our improved analysis of the Quasi-Random PCP proves stronger properties of the PCP which might be useful in other applications. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Rishi Saket 2010 Is Part Of LIPIcs, Volume 8, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2010.447 urn:nbn:de:0030-drops-28858 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.447 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode