2 papers
cs.LG2007
A Note on the Inapproximability of Correlation Clustering
Jinsong Tan
We consider inapproximability of the correlation clustering problem defined as follows: Given a graph where each edge is labeled either "+" (similar) or "-" (dissimilar…
cs.CC2007
Inapproximability of Maximum Weighted Edge Biclique and Its Applications
Jinsong Tan
Given a bipartite graph where edges take on {\it both} positive and negative weights from set , the {\it maximum weighted edge biclique} problem, or…