Applying local search to the feedback vertex set problem

Journal of Heuristics

Volumn 19, Issue 5, 2013, Pages 797-818

  Galinier, Philippe ^a   Lemamou, Eunice ^a   Bouzidi, Mohamed Wassim ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC GRAPHS; ADAPTIVE SEARCH; FEEDBACK SETS; FEEDBACK VERTEX SET PROBLEMS; LOCAL SEARCH; LOCAL TRANSFORMATIONS; SIMULATED ANNEALING ALGORITHMS; SOLUTION REPRESENTATION;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; SOFTWARE ENGINEERING;

COMPUTATIONAL COMPLEXITY;

EID: 84885641680     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-013-9224-z     Document Type: Article

References (20)

1. AT &T Labs: Personal page of Mauricio Resende at AT &T Labs. http://www2.research.att.com/~mgcr/. Accessed Mar 2013
2. Bafna, V.; Berman, P.; Fujito, T.: Approximating feedback vertex set for undirected graphs within ratio 2, manuscript (1994)
3. Becker, A.; Geiger, G.: Approximation algorithms for the loop cutset problem. In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, pp. 60-68 (1979)
4. Cerny, V.: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41-51 (1985)
5. Feo, T.A.; Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109-133 (1995)
6. Festa, P.; Pardalos, P.M.; Resende, M.G.C.: Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. ACM Trans. Math. Softw. 27(4), 456-464 (2001)
7. Festa, P.; Pardalos, P.M.; Resende, M.G.C.: Feedback set problems. In: Floudas, C.A.; Pardalos, P.M. (eds.) Encyclopedia of optimization, pp. 1005-1016. Springer, Heidelberg (2009)
8. Garey, M.R.; Johnson, D.S.: Computers and reducibility: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco (1979)
9. Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
10. Levy, H.; Low, D.W.: A contraction algorithm for finding small cycle cutsets. J. Algorithms 9(4), 470-493 (1988)
11. Lin, H.M.; Jou, J.Y.: Computing minimum feedback vertex sets by contraction operations and its applications on CAD. In: (ICCD '99) International Conference on Computer Design, pp. 364-369 (1999)
12. Monien, B.; Schultz, R.: Four approximation algorithms for the feedback vertex set problem. In: Proceedings of the 7th Conference on Graph Theoretic Concepts of Computer Science, pp. 315-390 (1981)
13. Morgenstern, C.: Distributed coloration neighborhood search. In: Johnson, D.; Trick, M. (eds.) Cliques, coloring, and satisfiability, DIMACS: series in discrete mathematics and theoretical computer science, vol. 26, pp. 335-357. American Mathematical Society, New Providence (1996)
14. Pardalos, P.M.; Qian, T.; Resende, M.G.C.: A greedy randomized adaptive search procedure for feedback vertex set. J. Comb. Optim. 2, 399-412 (1999)
15. Qian, T.; Ye, Y.; Pardalos, P.M.: A pseudo-approximation algorithm for FVS. In: Floudas, C.; Pardalos, P. (eds.) State of the art in global optimization, pp. 341-351. Kluwer Academic Publishers, Dordrecht, Boston, London (1996)
16. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15, 182-188 (1995)
17. The New York Times: New 'micros' disclosed. The New York Times, 28 Jan 1993
18. Wikipedia. http://en.wikipedia.org/wiki/SGI-Challenge. Accessed Mar 2013
19. Yannakakis, M.: Node and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 253-264 (1978)
20. Yehuda, B.; Geiger, D.; Naor, J.; Roth, R.M.: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 344-354 (1994)