Abstract
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The WFVP on general graphs is known to be NP-hard and to be polynomially solvable on some special classes of graphs (e.g., interval graphs, co-comparability graphs, diamond graphs). In this paper we introduce an extension of diamond graphs, namely the k-diamond graphs, and give a dynamic programming algorithm to solve WFVP in linear time on this class of graphs. Other than solving an open question, this algorithm allows an efficient exploration of a neighborhood structure that can be defined by using such a class of graphs. We used this neighborhood structure inside our Iterated Tabu Search heuristic. Our extensive experimental results show the effectiveness of this heuristic in improving the solution provided by a 2-approximate algorithm for the WFVP on general graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Berman, P., Fujito, T.: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discrete Math. 12(3), 289–297 (1999)
Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. 27(4), 942–959 (1998)
Becker, A., Geiger, D.: Approximation Algorithms for the Loop Cutset Problem. In: Proceedings of the 10th Conference on Uncertainty in Articial Intelligence, pp. 60–68 (1994)
Brunetta, L., Maffioli, F., Trubian, M.: Solving The Feedback Vertex Set Problem On Undirected Graphs. Discrete Applied Mathematics 101, 37–51 (2000)
Carrabs, F., Cerulli, R., Gentili, M., Parlato, G.: A Linear Time Algorithm for the Minimum Weighted Feedback Vertex Set on Diamonds. Information Processing Letters 94, 29–35 (2005)
Chang, M.S., Liang, Y.D.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica 34, 337–346 (1997)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2001)
Even, G., Naor, J., Schieber, B., Zosin, L.: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discrete Math. 13(2), 255–267 (2000)
Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184–191. Springer, Heidelberg (2006)
Glover, F.: Tabu Search. ORSA Journal on Computing 1, 190–206 (1989)
Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)
Glover, F.: Tabu Search: A Tutorial. Interfaces 20, 74–94 (1990)
Kleinberg, J., Kumar, A.: Wavelength Conversion in Optical Networks. Journal of Algorithms, 566–575 (1999)
Liang, Y.D.: On the feedback vertex set problem in permutation graphs. Information Processing Letters 52, 123–129 (1994)
Lu, C.L., Tang, C.Y.: A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs. Information Processing Letters 61, 107–111 (1997)
Misevicius, A., Lenkevicius, A., Rubliauskas, D.: Iterated tabu search: an improvement to standard tabu search. Information Technology and Control 35(3), 187–197 (2006)
Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 160–171. Springer, Heidelberg (2006)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carrabs, F., Cerulli, R., Gentili, M., Parlato, G. (2011). A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)