A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 12 (3) , 289-297
- https://doi.org/10.1137/s0895480196305124
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A unified approximation algorithm for node-deletion problemsDiscrete Applied Mathematics, 1998
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian InferenceSIAM Journal on Computing, 1998
- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and ColoringJournal of Graph Algorithms and Applications, 1997
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980