Advanced

On the approximability of maximum and minimum edge clique partition problems

Dessmark, Anders LU ; Jansson, Jesper LU ; Lingas, Andrzej LU ; Lundell, Eva-Marta LU and Persson, Mia LU (2006) The Australasian Theory Symposium (CATS) In Conferences in Research and Practice in Information Technology Series 168. p.101-105
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Conferences in Research and Practice in Information Technology Series
volume
168
pages
101 - 105
publisher
Australian Computer Society
conference name
The Australasian Theory Symposium (CATS)
external identifiers
  • Scopus:84863559579
ISBN
1-920682-33-3
1445-1336
project
VR 2005-4085
language
English
LU publication?
yes
id
28cf700e-d0a0-4996-8142-6210bc794e15 (old id 623064)
alternative location
http://crpit.com/abstracts/CRPITV51Dessmark.html
date added to LUP
2007-11-26 09:59:31
date last changed
2016-10-13 04:46:00
@misc{28cf700e-d0a0-4996-8142-6210bc794e15,
  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.},
  author       = {Dessmark, Anders and Jansson, Jesper and Lingas, Andrzej and Lundell, Eva-Marta and Persson, Mia},
  isbn         = {1-920682-33-3},
  language     = {eng},
  pages        = {101--105},
  publisher    = {ARRAY(0xbfde920)},
  series       = {Conferences in Research and Practice in Information Technology Series},
  title        = {On the approximability of maximum and minimum edge clique partition problems},
  volume       = {168},
  year         = {2006},
}