Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 142-151
- https://doi.org/10.1007/bfb0015417
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximation Algorithms for the Loop Cutset ProblemPublished by Elsevier ,1994
- The approximation of maximum subgraph problemsPublished by Springer Nature ,1993
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- A Local-Ratio Theorem for Approximating the Weighted Vertex Cover ProblemPublished by Elsevier ,1985
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972