Solving the feedback vertex set problem on undirected graphs

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 37-51

  Brunetta, Lorenzo ^a   Maffioli, Francesco ^a   Trubian, Marco ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Branch and Cut; Feedback vertex set; Local search heuristic; Tabu search

Indexed keywords

EID: 0347304334     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00180-8     Document Type: Article

References (21)

1. V. Bafna, P. Berman, T. Fujito, Constant ratio approximations of the feedback vertex set problem for undirected graphs, in: J. Staples P. Eades, N. Katoh, A. Moffat (Eds.), ISAC 95, Algorithms and Computation, 1995, pp. 142-151.
2. R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth, Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference, Proceedings of the 5th Annual ACM SIAM Symposium on Discrete Algorithms, 1994, pp. 344-354.
3. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, in: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 1994, pp. 60-68.
4. S. Ceria, P. Nobili, A. Sassano, Set covering problem, in: M. Dell'Amico, S. Martello, F. Maffioli (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 415-428.
5. Chudak F.A., Goemans M.X., Hochbaum D.S., Williamson D.P. A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. Res. Lett. 22:1998;111-118.
6. Chvátal V. A greedy heuristic for the set covering. Math. Oper. Res. 7:1979;515-531.
7. Coorg S.R., Rangan C.P. Feedback vertex set on cocomparability graphs. Networks. 26:1995;101-111.
8. Dechter R. Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition. Artificial Intell. 41:1990;273-312.
9. M. Dell'Amico, A. Lodi, F. Maffioli, Solution of the cumulative assignment problem with a new tabu search method, J. Heuristics (1997) , to appear.
10. Dell'Amico M., Trubian M. Solution of large weighted equicut problems. European J. Oper. Res. 106:1998;500-521.
11. M. Funke, G. Reinelt, A polyhedral approach to the feedback vertex set problem, in: Proc. 5th Int. IPCO Conf., Vancouver, 1996, pp. 445-459.
12. Glover F. Tabu search - Part 1. ORSA J. Comput. 1:1989;190-206.
13. D.S. Hochbaum, Various notions of approximations: good, better, best, and more, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems PWS, Boston, 1996, pp. 347-363.
14. R.M. Karp, Reducibility among combinatorial problems, in: R. Miller, J. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
15. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Generating all maximal independent sets: NP-hardness and polynomial time algorithms. SIAM J. Comput. 9 / 3:1980;559-565.
16. Llyod E.L., Soffa M.L. On locating minimum feedback vertex sets. J. Comput. Systems Sci. 37:1988;292-311.
17. Luccio F.L. Almost exact minimum feedback vertex set in meshes and butterflies. Inform. Process. Lett. 66:1998;59-64.
18. Lu C., Tang C. A linear-time algorithm for the weighted feedback vertex problem on interval graphs. Inform. Process. Lett. 61:1997;107-112.
19. D. Peleg, Local majority voting, small coalitions and controlling monopolies in graphs: a review, in: Proceeding of 3rd Colloqium on Structural Information and Communications Complexity, 1996, pp. 152-169.
20. D. Peleg, Size bounds for dynamic monopolies, Proceeding of 4th Colloqium on Structural Information and Communications Complexity, 1997, pp. 165-175.
21. Wang C., Lloyd E., Soffa M. Feedback vertex set and cyclically reducible graphs. J. ACM. 32:1985;296-313.