Document Open Access Logo

Solving Directed Multiway Cut Faster Than 2ⁿ

Author Mingyu Xiao

PDF
Thumbnail PDF

File

LIPIcs.ESA.2024.104.pdf
  • Filesize: 0.89 MB
  • 13 pages

Document Identifiers

Author Details

Mingyu Xiao
  • School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China

Funding

Mingyu Xiao acknowledges the National Science Foundation of China under Grant No. 62372095.

Cite AsGet BibTex

Mingyu Xiao. Solving Directed Multiway Cut Faster Than 2ⁿ. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 104:1-104:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.104

Abstract

In the Directed Multiway Cut problem, we are given a directed graph G = (V,E) and a subset T ⊆ V, called the terminal set. The aim is to find a minimum sized set S ⊆ V⧵ T, such that after deleting S, no directed path exists from one terminal to another terminal in the remaining graph. It has been an open question whether Directed Multiway Cut can be solved faster than the trivial running-time bound O^*(2^{|V|}). In this paper, we provide a positive answer to this question, presenting an algorithm with a running-time bound O(1.9967^{|V|}).

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Exact Algorithms
  • Parameterized Algorithms
  • Directed Multiway Cut
  • Directed Multicut
  • Directed Graphs

Metrics

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

References

  1. Gruia Călinescu, Cristina G. Fernandes, and Bruce A. Reed. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms, 48(2):333-359, 2003. Google Scholar
  2. Jianer Chen, Yang Liu, and Songjian Lu. An improved parameterized algorithm for the minimum node multiway cut problem. Algorithmica, 55(1):1-13, 2009. Google Scholar
  3. Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, and Saket Saurabh. Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci., 88:195-207, 2017. Google Scholar
  4. Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, and Jakub Onufry Wojtaszczyk. On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory, 5(1):3:1-3:11, 2013. Google Scholar
  5. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, and Mihalis Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23(4):864-894, 1994. Google Scholar
  6. David Eppstein. Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms, 2(4):492-509, 2006. URL: https://doi.org/10.1145/1198513.1198515.
  7. Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, and Roohani Sharma. Optimally repurposing existing algorithms to obtain exponential-time approximations. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 314-345. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.13.
  8. Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. Exact algorithms via monotone local search. J. ACM, 66(2):8:1-8:23, 2019. Google Scholar
  9. Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, and Igor Razgon. On the minimum feedback vertex set problem: Exact and enumeration algorithms. Algorithmica, 52(2):293-307, 2008. Google Scholar
  10. Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. A measure & conquer approach for the analysis of exact algorithms. J. ACM, 56(5):25:1-25:32, 2009. URL: https://doi.org/10.1145/1552285.1552286.
  11. Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, and Yngve Villanger. Enumerating minimal subset feedback vertex sets. Algorithmica, 69(1):216-231, 2014. Google Scholar
  12. Fedor V. Fomin and Dieter Kratsch. Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2010. Google Scholar
  13. Naveen Garg, Vijay V. Vazirani, and Mihalis Yannakakis. Multiway cuts in node weighted graphs. J. Algorithms, 50(1):49-61, 2004. Google Scholar
  14. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367-375, 2001. Google Scholar
  15. Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchý. Solving multicut faster than 2ⁿ. In Andreas S. Schulz and Dorothea Wagner, editors, Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, volume 8737 of Lecture Notes in Computer Science, pages 666-676. Springer, 2014. Google Scholar
  16. W. Mader. Über die maximalzahl kreuzungsfreier h-wege. Arch. Math. (Basel), 31(4):387-402, 1978/1979. Google Scholar
  17. Joseph Naor and Leonid Zosin. A 2-approximation algorithm for the directed multiway cut problem. SIAM J. Comput., 31(2):477-482, 2001. URL: https://doi.org/10.1137/S009753979732147X.
  18. Marcin Pilipczuk and Magnus Wahlström. Directed multicut is w[1]-hard, even for four terminal pairs. ACM Trans. Comput. Theory, 10(3):13:1-13:18, 2018. URL: https://doi.org/10.1145/3201775.
  19. Igor Razgon. Exact computation of maximum induced forest. In Lars Arge and Rusins Freivalds, editors, Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, volume 4059 of Lecture Notes in Computer Science, pages 160-171. Springer, 2006. Google Scholar
  20. Mingyu Xiao. Simple and improved parameterized algorithms for multiterminal cuts. Theory Comput. Syst., 46(4):723-736, 2010. Google Scholar
  21. Mingyu Xiao and Hiroshi Nagamochi. An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim., 30(2):214-241, 2015. 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