License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2023.65
URN: urn:nbn:de:0030-drops-181176
URL: https://drops.dagstuhl.de/opus/volltexte/2023/18117/
Go to the corresponding LIPIcs Volume Portal


Garg, Mohit ; Hommelsheim, Felix ; Megow, Nicole

Matching Augmentation via Simultaneous Contractions

pdf-format:
LIPIcs-ICALP-2023-65.pdf (0.7 MB)


Abstract

We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a 2-edge-connected spanning subgraph by adding the minimum number of edges to it. We present a polynomial-time algorithm with an approximation ratio of 13/8 = 1.625 improving upon an earlier 5/3-approximation. The improvement builds on a new α-approximation preserving reduction for any α ≥ 3/2 from arbitrary MAP instances to well-structured instances that do not contain certain forbidden structures like parallel edges, small separators, and contractible subgraphs. We further introduce, as key ingredients, the technique of repeated simultaneous contractions and provide improved lower bounds for instances that cannot be contracted.

BibTeX - Entry

@InProceedings{garg_et_al:LIPIcs.ICALP.2023.65,
  author =	{Garg, Mohit and Hommelsheim, Felix and Megow, Nicole},
  title =	{{Matching Augmentation via Simultaneous Contractions}},
  booktitle =	{50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
  pages =	{65:1--65:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-278-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{261},
  editor =	{Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/18117},
  URN =		{urn:nbn:de:0030-drops-181176},
  doi =		{10.4230/LIPIcs.ICALP.2023.65},
  annote =	{Keywords: matching augmentation, approximation algorithms, 2-edge-connectivity}
}

Keywords: matching augmentation, approximation algorithms, 2-edge-connectivity
Collection: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Issue Date: 2023
Date of publication: 05.07.2023


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI