Sciweavers

Share
ORL
1998

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

8 years 8 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
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 simpliÿcation of the Bafna et al. algorithm. c 1998 Elsevier Science B.V. All rights reserved.
Fabián A. Chudak, Michel X. Goemans, Dorit
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where ORL
Authors Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson
Comments (0)
books