Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
From MaRDI portal
Publication:5146923
DOI10.1137/1.9781611975994.134OpenAlexW3002240277MaRDI QIDQ5146923
Saket Saurab, Meirav Zehavi, M. S. Ramanujan, Daniel Lokshtanov
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.04249
Related Items (9)
Hitting Weighted Even Cycles in Planar Graphs ⋮ Odd cycle transversal in mixed graphs ⋮ Odd Multiway Cut in Directed Acyclic Graphs ⋮ Multi-Budgeted Directed Cuts ⋮ Unnamed Item ⋮ Parameterized inapproximability of independent set in \(H\)-free graphs ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Parameterized algorithms for generalizations of directed feedback vertex set ⋮ To close is easier than to open: dual parameterization to \(k\)-median
This page was built for publication: Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
