Solving the feedback vertex set problem on undirected graphs

[1]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[2]  Eugene L. Lawler,et al.  Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms , 1980, SIAM J. Comput..

[3]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[4]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[5]  Mary Lou Soffa,et al.  On Locating Minimum Feedback Vertex Sets , 1988, J. Comput. Syst. Sci..

[6]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[7]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[8]  Dan Geiger,et al.  Approximation Algorithms for the Loop Cutset Problem , 1994, UAI.

[9]  C. Pandu Rangan,et al.  Feedback vertex set on cocomparability graphs , 1995, Networks.

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

[11]  Gerhard Reinelt,et al.  A Polyhedral Approach to the Feedback Vertex Set Problem , 1996, IPCO.

[12]  D. Peleg.  Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review , 1996 .

[13]  Dorit S. Hochbaum,et al.  Various notions of approximations: good, better, best, and more , 1996 .

[14]  Chuan Yi Tang,et al.  A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs , 1997, Inf. Process. Lett..

[15]  David Peleg,et al.  Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..

[16]  Reuven Bar-Yehuda,et al.  Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..

[17]  Flaminia L. Luccio.  Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies , 1998, Inf. Process. Lett..

[18]  David P. Williamson,et al.  A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs , 1998, Oper. Res. Lett..

[19]  Mauro Dell'Amico,et al.  Solution of large weighted equicut problems , 1998, Eur. J. Oper. Res..

[20]  Mauro Dell'Amico,et al.  Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method , 1999, J. Heuristics.