Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can be explained in terms of the primal-dual method for approximation algorithms, which has been used to derive approximation algorithms for network design problems. In the process, we give a new integer programming formulation for the feedback vertex set problem whose integrality gap is at worst a factor of two; the well-known cycle formulation has an integrality gap of Θ(log n), as shown by Even, Naor, Schieber and Zosin. We also give a new 2-approximation algorithm for the problem which is a simplification of the Bafna et al. algorithm. © 1998 Elsevier Science B.V. All rights reserved.
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010