Document Open Access Logo

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus

Author Hao Sun

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2024.18.pdf
  • Filesize: 0.88 MB
  • 20 pages

Document Identifiers

Author Details

Hao Sun
  • University of Alberta, 116 St & 85 Ave, Edmonton, AB T6G 2R3, Canada

Acknowledgements

The author would like to thank Zachary Friggstad for invaluable guidance in the writing process and Jochen Koenemann for suggesting the problem.

Cite AsGet BibTex

Hao Sun. A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.18

Abstract

The minimum directed feedback vertex set problem consists in finding the minimum set of vertices that should be removed in order to make a directed graph acyclic. This is a well-known NP-hard optimization problem with applications in various fields, such as VLSI chip design, bioinformatics and transaction processing deadlock prevention and node-weighted network design. We show a constant factor approximation for the directed feedback vertex set problem in graphs of bounded genus.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graphs and surfaces
  • Mathematics of computing → Approximation algorithms
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Rounding techniques
  • Theory of computation → Packing and covering problems
Keywords
  • Feedback Vertex Set
  • Combinatorial Optimization
  • Approximation Algorithms
  • min-max relation
  • linear programming

Metrics

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

Related Versions

References

  1. M.A. Armstrong. Basic Topology. Undergraduate Texts in Mathematics. Springer New York, 2013. URL: https://books.google.ca/books?id=NJbuBwAAQBAJ.
  2. Vineet Bafna, Piotr Berman, and Toshihiro Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math., 12:289-297, 1999. Google Scholar
  3. Piotr Berman and Grigory Yaroslavtsev. Primal-dual approximation algorithms for node-weighted network design in planar graphs. In Anupam Gupta, Klaus Jansen, José Rolim, and Rocco Servedio, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 50-60, Berlin, Heidelberg, 2012. Google Scholar
  4. A.C. da Silva and LINK (Online service). Lectures on Symplectic Geometry. Number no. 1764 in Lecture Notes in Mathematics. Springer, 2001. URL: https://books.google.ca/books?id=r9i6pXc7GEQC.
  5. E. D. Demaine and M. Hajiaghayi. The bidimensionality theory and its algorithmic applications. The Computer Journal, 51(3):292-302, 2008. Google Scholar
  6. Reinhard Diestel. Graph Theory. Springer Publishing Company, Incorporated, 5th edition, 2017. Google Scholar
  7. G. Even, J. (Seffi) Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998. Google Scholar
  8. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Bidimensionality and eptas. In Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '11, pages 748-759, Philadelphia, PA, USA, 2011. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=2133036.2133095.
  9. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Bidimensionality and kernels. CoRR, 2016. Google Scholar
  10. Georges Gardarin and Stefano Spaccapietra. Integrity of data bases: A general lockout algorithm with deadlock avoidance. In G. M. Nijssen, editor, Modelling in Data Base Management Systems, Proceeding of the IFIP Working Conference on Modelling in Data Base Management Systems, Freudenstadt, Germany, January 5-8, 1976, pages 395-412. North-Holland, 1976. Google Scholar
  11. Michel X. Goemans and David P. Williamson. The Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems, pages 144-191. PWS Publishing Co., USA, 1996. Google Scholar
  12. Michel X. Goemans and David P. Williamson. Primal-dual approximation algorithms for feedback problems in planar graphs. Combinatorica, 18(1):37-59, 1998. Google Scholar
  13. Venkatesan Guruswami and Euiwoong Lee. Simple proof of hardness of feedback vertex set. Theory of Computing, 12(6):1-11, 2016. URL: https://doi.org/10.4086/toc.2016.v012a006.
  14. Allen Hatcher. Notes on basic 3-manifold topology, 2007. URL: https://pi.math.cornell.edu/~hatcher/3M/3M.pdf.
  15. The Amplitwist (https://mathoverflow.net/users/183188/the amplitwist). If a graph embedded on a surface is divided by a curve into a right and left that do not intersect can it be embedded on a surface of smaller genus? MathOverflow. (version: 2023-11-19). URL: https://mathoverflow.net/q/458733.
  16. Richard M. Karp. Reducibility among Combinatorial Problems, pages 85-103. Springer US, Boston, MA, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  17. L.C. Kinsey. Topology of Surfaces. Undergraduate Texts in Mathematics. Springer New York, 1997. URL: https://books.google.gl/books?id=AKghdMm5W-YC.
  18. Lap Chi Lau, R. Ravi, and Mohit Singh. Iterative Methods in Combinatorial Optimization. Cambridge Texts in Applied Mathematics. Cambridge University Press, 2011. URL: https://doi.org/10.1017/CBO9780511977152.
  19. Charles E. Leiserson and James B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1):5-35, 1991. URL: https://doi.org/10.1007/BF01759032.
  20. Orna Lichtenstein and Amir Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL '85, pages 97-107, New York, NY, USA, 1985. Association for Computing Machinery. URL: https://doi.org/10.1145/318593.318622.
  21. Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, and Saket Saurabh. 2-approximating feedback vertex set in tournaments. ACM Trans. Algorithms, 17(2), April 2021. URL: https://doi.org/10.1145/3446969.
  22. J. Rydholm. Classification of compact orientable surfaces using morse theory, 2016. Google Scholar
  23. Niklas Schlomberg, Hanjo Thiele, and Jens Vygen. Packing cycles in planar and bounded-genus graphs, 2023. URL: https://arxiv.org/abs/2207.00450.
  24. Anke van Zuylen. Linear programming based approximation algorithms for feedback set problems in bipartite tournaments. In TAMC, 2009. Google Scholar
  25. J. W. T. Youngs. Minimal imbeddings and the genus of a graph. J. Math. Mech., 12:303-315, 1963. 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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact