A unified approximation algorithm for node-deletion problems
- 1 September 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 86 (2-3) , 213-231
- https://doi.org/10.1016/s0166-218x(98)00035-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Packing directed circuits fractionallyCombinatorica, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- On the Fractional Solution to the Set Covering ProblemSIAM Journal on Algebraic Discrete Methods, 1983
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980
- Node-Deletion NP-Complete ProblemsSIAM Journal on Computing, 1979
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979