A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- 1 May 1998
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 22 (4-5) , 111-118
- https://doi.org/10.1016/s0167-6377(98)00021-2
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problemArtificial Intelligence, 1996
- Primal-dual approximation algorithms for feedback problems in planar graphsPublished by Springer Nature ,1996
- A primal-dual approximation algorithm for generalized steiner network problemsCombinatorica, 1995
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphsPublished by Springer Nature ,1995