Constant factor approximation algorithm for l-pseudoforest deletion problem

DOI10.1007/978-3-319-94776-1_60MaRDI QIDQ1791042zbMATH OpenOpenAlexFDO

Authors Mugang Lin, Bin Fu, Qilong Feng

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_60

zbMATH Keywords

approximation algorithmlocal ratio\(l\)-pseudoforest deletion problem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• An approximation algorithm for the \(l\)-pseudoforest deletion problem
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Generalized pseudoforest deletion: algorithms and uniform kernel
• A faster parameterized algorithm for pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion

Cited in

(3)

• An approximation algorithm for the \(l\)-pseudoforest deletion problem
• A faster parameterized algorithm for pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion

This page was built for publication: Constant factor approximation algorithm for \(l\)-pseudoforest deletion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791042)