Document Open Access Logo

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

Authors Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal

PDF
Thumbnail PDF

File

LIPIcs.STACS.2019.19.pdf
  • Filesize: 0.7 MB
  • 14 pages

Document Identifiers

Author Details

Parinya Chalermsook
  • Aalto University, Espoo, Finland
Andreas Schmid
  • Max Planck Institute for Informatics, Saarbrücken, Germany
Sumedha Uniyal
  • Aalto University, Espoo, Finland

Funding

  • Chalermsook, Parinya: Part of this work was done while PC and AS were visiting the Simons Institute for the Theory of Computing. It was partially supported by the DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization through NSF grant #CCF-1740425. Parinya has been supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 759557) and by Academy of Finland Research Fellows, under grant number 310415 and 314284.
  • Uniyal, Sumedha: Partially supported by Academy of Finland under the grant agreement number 314284.

Cite AsGet BibTex

Parinya Chalermsook, Andreas Schmid, and Sumedha Uniyal. A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 19:1-19:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.STACS.2019.19

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.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
Keywords
  • Graph Drawing
  • Matroid Matching
  • Maximum Planar Subgraph
  • Local Search Algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Claude Berge. La theorie des graphes. Paris, France, 1958. Google Scholar
  2. Markus Bläser, Gorav Jindal, and Anurag Pandey. Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, pages 33:1-33:16, 2017. Google Scholar
  3. Gruia Călinescu, Cristina G Fernandes, Ulrich Finkler, and Howard Karloff. A better approximation algorithm for finding planar subgraphs. Journal of Algorithms, 27(2):269-302, 1998. Google Scholar
  4. Gruia Calinescu, Cristina G Fernandes, Howard Karloff, and Alexander Zelikovsky. A new approximation algorithm for finding heavy planar subgraphs. Algorithmica, 36(2):179-205, 2003. Google Scholar
  5. Gruia Călinescu, Cristina G Fernandes, Hemanshu Kaul, and Alexander Zelikovsky. Maximum series-parallel subgraph. Algorithmica, 63(1-2):137-157, 2012. Google Scholar
  6. Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, and Luca Trevisan. From gap-ETH to FPT-inapproximability: Clique, dominating set, and more. In Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on, pages 743-754. IEEE, 2017. Google Scholar
  7. Parinya Chalermsook and Andreas Schmid. Finding Triangles for Maximum Planar Subgraphs. In WALCOM: Algorithms and Computation, 11th International Conference and Workshops, (WALCOM'17), Proceedings., pages 373-384, 2017. Google Scholar
  8. Parinya Chalermsook, Andreas Schmid, and Sumedha Uniyal. A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. CoRR, abs/1804.03485, 2018. URL: http://arxiv.org/abs/1804.03485.
  9. Ho Yee Cheung, Lap Chi Lau, and Kai Man Leung. Algebraic algorithms for linear matroid parity problems. ACM Transactions on Algorithms (TALG), 10(3):10, 2014. Google Scholar
  10. Markus Chimani, Ivo Hedtke, and Tilo Wiedera. Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments. In 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, pages 22:1-22:15, 2018. URL: http://dx.doi.org/10.4230/LIPIcs.SEA.2018.22.
  11. Markus Chimani and Tilo Wiedera. Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast. In Yossi Azar, Hannah Bast, and Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms (ESA 2018), volume 112 of Leibniz International Proceedings in Informatics (LIPIcs), pages 19:1-19:14, Dagstuhl, Germany, 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2018.19.
  12. Harold N Gabow and Matthias Stallmann. An augmenting path algorithm for linear matroid parity. Combinatorica, 6(2):123-150, 1986. Google Scholar
  13. Magnús M Halldórsson. Approximations of weighted independent set and hereditary subset problems. In Graph Algorithms And Applications 2, pages 3-18. World Scientific, 2004. Google Scholar
  14. Johan Håstad. Clique is hard to approximate withinn 1- ε. Acta Mathematica, 182(1):105-142, 1999. Google Scholar
  15. T.A. Jenkyns. Matchoids : a Generalization of Matchings and Matroids. Thesis (Ph.D.)-University of Waterloo, 1974. Google Scholar
  16. M. Jünger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33-59, July 1996. URL: http://dx.doi.org/10.1007/BF02086607.
  17. Subhash Khot and Ashok Kumar Ponnuswami. Better inapproximability results for maxclique, chromatic number and min-3lin-deletion. In International Colloquium on Automata, Languages, and Programming, pages 226-237. Springer, 2006. Google Scholar
  18. Eugene L Lawler. Combinatorial optimization: networks and matroids. Courier Corporation, 1976. Google Scholar
  19. Jon Lee, Maxim Sviridenko, and Jan Vondrák. Matroid matching: the power of local search. SIAM Journal on Computing, 42(1):357-379, 2013. Google Scholar
  20. John M Lewis and Mihalis Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219-230, 1980. Google Scholar
  21. László Lovász. Matroid matching and some applications. Journal of Combinatorial Theory, Series B, 28(2):208-236, 1980. Google Scholar
  22. László Lovász and Michael D Plummer. Matching theory, volume 367. American Mathematical Soc., 2009. Google Scholar
  23. Carsten Lund and Mihalis Yannakakis. The approximation of maximum subgraph problems. In International Colloquium on Automata, Languages, and Programming, pages 40-51. Springer, 1993. Google Scholar
  24. James B Orlin. A fast, simpler algorithm for the matroid parity problem. In International Conference on Integer Programming and Combinatorial Optimization, pages 240-258. Springer, 2008. Google Scholar
  25. Zoltán Szigeti. On a min-max theorem of cacti. In International Conference on Integer Programming and Combinatorial Optimization, pages 84-95. Springer, 1998. Google Scholar
  26. William T Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 1(2):107-111, 1947. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023 Schloss Dagstuhl - LZI GmbH Imprint Privacy Contact