Carrabs, Francesco, Cerulli, Raffaele, Gentili, Monica and Parlato, Gennaro
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
At Network Optimization: 5th International Conference, (INOC), Germany.
13 - 16 Jun 2001.
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 exten- sion of diamond graphs, namely the k-diamond graphs, and give a dynamic pro- gramming 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 show the effectiveness of this heuristic in improving the solution provided by a 2-approximate algorithm for the WFVPon general graphs.
Conference or Workshop Item
||Event Dates: June 13-16, 2001
|Venue - Dates:
||Network Optimization: 5th International Conference, (INOC), Germany, 2001-06-13 - 2001-06-16
||Electronic & Software Systems
||13 Jun 2011 14:25
||23 Feb 2017 08:30
|Further Information:||Google Scholar|
Actions (login required)