A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach

DOI10.1016/0020-0190(96)00094-4zbMath0875.68704OpenAlexW2079730540MaRDI QIDQ671377

Toshihiro Fujito

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00094-4

zbMATH Keywords

OptimizationCombinatorial problemsDesign of algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

On the Complexity of Singly Connected Vertex Deletion ⋮ A naive algorithm for feedback vertex set ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem ⋮ On the complexity of singly connected vertex deletion

Cites Work

• Ramsey numbers and an approximation algorithm for the vertex cover problem
• Optimization, approximation, and complexity classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach