Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2015.554
URN: urn:nbn:de:0030-drops-49411
URL: https://drops.dagstuhl.de/opus/volltexte/2015/4941/
Klein, Philip N. ; Mathieu, Claire ; Zhou, Hang
Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs
| pdf-format: |
|
Abstract
In correlation clustering, the input is a graph with edge-weights, where every edge is labelled either + or - according to similarity of its endpoints. The goal is to produce a partition of the vertices that disagrees with the edge labels as little as possible.In two-edge-connected augmentation, the input is a graph with edge-weights and a subset R of edges of the graph. The goal is to produce a minimum weight subset S of edges of the graph, such that for every edge in R, its endpoints are two-edge-connected in R\cup S.
For planar graphs, we prove that correlation clustering reduces to two-edge-connected augmentation, and that both problems have a polynomial-time approximation scheme.
BibTeX - Entry
@InProceedings{klein_et_al:LIPIcs:2015:4941,
author = {Philip N. Klein and Claire Mathieu and Hang Zhou},
title = {{Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs}},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages = {554--567},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-78-1},
ISSN = {1868-8969},
year = {2015},
volume = {30},
editor = {Ernst W. Mayr and Nicolas Ollinger},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/4941},
URN = {urn:nbn:de:0030-drops-49411},
doi = {10.4230/LIPIcs.STACS.2015.554},
annote = {Keywords: correlation clustering, two-edge-connected augmentation, polynomial-time approximation scheme, planar graphs}
}
| Keywords: | correlation clustering, two-edge-connected augmentation, polynomial-time approximation scheme, planar graphs | |
| Seminar: | 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) | |
| Issue date: | 2015 | |
| Date of publication: | 26.02.2015 |
