Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
From MaRDI portal
Publication:5888942
DOI10.1145/3389338OpenAlexW3042150117MaRDI QIDQ5888942
Pranabendu Misra, Saket Saurabh, Akanksha Agrawal, Daniel Lokshtanov, Meirav Zehavi
Publication date: 26 April 2023
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3389338
approximation algorithmchordal graphsdistance hereditary graphsbalanced separators\(\mathcal{F}\)-vertex deletionplanar \(\mathcal{F}\)-minor-free graphs
Related Items (4)
Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set
This page was built for publication: Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
