License: 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.2019.19
URN: urn:nbn:de:0030-drops-102583
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10258/
Go to the corresponding LIPIcs Volume Portal

Chalermsook, Parinya ; Schmid, Andreas ; Uniyal, Sumedha

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

pdf-format:
LIPIcs-STACS-2019-19.pdf (0.7 MB)

Abstract

A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph G contains a cactus subgraph C where C contains at least a 1/6 fraction of the triangular faces of G. We also show that this ratio cannot be improved by showing a tight lower bound. Together with an algorithm for linear matroid parity, our bound implies two approximation algorithms for computing "dense planar structures" inside any graph: (i) A 1/6 approximation algorithm for, given any graph G, finding a planar subgraph with a maximum number of triangular faces; this improves upon the previous 1/11-approximation; (ii) An alternate (and arguably more illustrative) proof of the 4/9 approximation algorithm for finding a planar subgraph with a maximum number of edges.
Our bound is obtained by analyzing a natural local search strategy and heavily exploiting the exchange arguments. Therefore, this suggests the power of local search in handling problems of this kind.

BibTeX - Entry

@InProceedings{chalermsook_et_al:LIPIcs:2019:10258,
  author =	{Parinya Chalermsook and Andreas Schmid and Sumedha Uniyal},
  title =	{{A Tight Extremal Bound on the Lov{\'a}sz Cactus Number in Planar Graphs}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{19:1--19:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Rolf Niedermeier and Christophe Paul},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10258},
  doi =		{10.4230/LIPIcs.STACS.2019.19},
  annote =	{Keywords: Graph Drawing, Matroid Matching, Maximum Planar Subgraph, Local Search Algorithms}
}

Keywords: Graph Drawing, Matroid Matching, Maximum Planar Subgraph, Local Search Algorithms
Collection: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Issue Date: 2019
Date of publication: 12.03.2019

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