On the approximability of maximum and minimum edge clique partition problems

Authors:
Anders Dessmark;Jesper Jansson;Andrzej Lingas;Eva-Marta Lundell;Mia Persson
Affiliations:
Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden;School of Technology and Society, Malmö University College, Malmö, Sweden
Venue:
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Year:
2006

Citing 9
Cited 0

The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Some optimal inapproximability results

Journal of the ACM (JACM)
Cluster Graph Modification Problems

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Clustering with Qualitative Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Correlation Clustering: maximizing agreements via semidefinite programming

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Correlation Clustering

Machine Learning
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximate clustering of fingerprint vectors with missing values

CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone classification. We investigate the hardness of finding such partitions and provide approximation algorithms. Further, we show that greedy strategies yield constant factor approxi mations for graph classes for which maximum cliques can be found efficiently.