Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.26
URN: urn:nbn:de:0030-drops-146076
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14607/
Casel, Katrin ; Friedrich, Tobias ; Issac, Davis ; Niklanovits, Aikaterini ; Zeif, Ziena
Balanced Crown Decomposition for Connectivity Constraints
| pdf-format: |
|
Abstract
We introduce the balanced crown decomposition that captures the structure imposed on graphs by their connected induced subgraphs of a given size. Such subgraphs are a popular modeling tool in various application areas, where the non-local nature of the connectivity condition usually results in very challenging algorithmic tasks. The balanced crown decomposition is a combination of a crown decomposition and a balanced partition which makes it applicable to graph editing as well as graph packing and partitioning problems. We illustrate this by deriving improved approximation algorithms and kernelization for a variety of such problems.In particular, through this structure, we obtain the first constant-factor approximation for the Balanced Connected Partition (BCP) problem, where the task is to partition a vertex-weighted graph into k connected components of approximately equal weight. We derive a 3-approximation for the two most commonly used objectives of maximizing the weight of the lightest component or minimizing the weight of the heaviest component.
BibTeX - Entry
@InProceedings{casel_et_al:LIPIcs.ESA.2021.26,
author = {Casel, Katrin and Friedrich, Tobias and Issac, Davis and Niklanovits, Aikaterini and Zeif, Ziena},
title = {{Balanced Crown Decomposition for Connectivity Constraints}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14607},
URN = {urn:nbn:de:0030-drops-146076},
doi = {10.4230/LIPIcs.ESA.2021.26},
annote = {Keywords: crown decomposition, connected partition, balanced partition, approximation algorithms}
}
| Keywords: | crown decomposition, connected partition, balanced partition, approximation algorithms | |
| Seminar: | 29th Annual European Symposium on Algorithms (ESA 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 31.08.2021 |
