Verwandte Artikel zu On The Correlation Clustering Problem: Algorithm for...

On The Correlation Clustering Problem: Algorithm for Correlation Clustering Problem - Softcover

Penumatcha, Sriram

 
9783838313542: On The Correlation Clustering Problem: Algorithm for Correlation Clustering Problem
Softcover
ISBN 10: 3838313542 ISBN 13: 9783838313542
Verlag: LAP LAMBERT Academic Publishing, 2009

Inhaltsangabe

We consider the correlation clustering problem which was initially introduced by Bansal, Blum, Chawla et al. Given a complete graph G on n vertices, with weights of +1 or -1 defined on the edges, we want to find a partition which maximizes the sum of the number of edges with positive weights inside the clusters plus the number of edges with negative weights between different clusters. In this thesis we present a deterministic polynomial time approximation scheme for finding such a partition. Our approach is different from the one given by Bansal, Blum, Chawla et al. as it relies on the Szemeredi's Regularity Lemma. We start by introducing the problem, then we introduce the concepts of regularity lemma and give a proof of Szemeredi's Regularity Lemma. Then we present the algorithm and the proof of the correctness of the algorithm.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

I graduated from Arizona State University with MA in Mathematics.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
LAP LAMBERT Academic Publishing
Erscheinungsdatum
2009
Sprache
Englisch
ISBN 10 
3838313542
ISBN 13 
9783838313542
Einband
Taschenbuch
Anzahl der Seiten
64
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Deutschland