论文信息 - A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach

A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach

We consider the vertex cover and feedback vertex set problems for undirected graphs, and show that they are structurally closely related via the standard vector spaces associated with the graphs. This observation will then be used to demonstrate that these two problems can be efficiently approximated within a same constant factor of 2 by essentially the same heuristics.

Toshihiro Fujito | Toshihiro Fujito

[1] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[2] Piotr Berman,et al. Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs , 1995, ISAAC.

[3] Burkhard Monien,et al. Four Approximation Algorithms for the Feedback Vertex Set Problem , 1981, International Workshop on Graph-Theoretic Concepts in Computer Science.

[4] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[5] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[6] Reuven Bar-Yehuda,et al. Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference , 1994, SODA '94.

[7] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.