The University of Southampton
University of Southampton Institutional Repository

A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem

A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
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 show the effectiveness of this heuristic in improving the solution provided by a 2-approximate algorithm for the WFVPon general graphs.
Carrabs, Francesco
8307d568-a1b9-4242-8f6d-adc36030775f
Cerulli, Raffaele
a2108ced-4bd4-48a9-9c1a-03464a9bbdc2
Gentili, Monica
10623d29-eb88-4791-afa3-927640edd544
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Carrabs, Francesco
8307d568-a1b9-4242-8f6d-adc36030775f
Cerulli, Raffaele
a2108ced-4bd4-48a9-9c1a-03464a9bbdc2
Gentili, Monica
10623d29-eb88-4791-afa3-927640edd544
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923

Carrabs, Francesco, Cerulli, Raffaele, Gentili, Monica and Parlato, Gennaro (2011) A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem. Network Optimization: 5th International Conference, (INOC), Germany. 13 - 16 Jun 2001. (In Press)

Record type: Conference or Workshop Item (Paper)

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 show the effectiveness of this heuristic in improving the solution provided by a 2-approximate algorithm for the WFVPon general graphs.

Text LNCS_INOC2011_Tabu.pdf - Accepted Manuscript
Download (205kB)

More information

Accepted/In Press date: 2011
Additional Information: Event Dates: June 13-16, 2001
Venue - Dates: Network Optimization: 5th International Conference, (INOC), Germany, 2001-06-13 - 2001-06-16
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272461
URI: https://eprints.soton.ac.uk/id/eprint/272461
PURE UUID: 2f5460ce-77b3-491c-80f8-3ff67aaad1b8

Catalogue record

Date deposited: 13 Jun 2011 14:25
Last modified: 20 Jun 2018 16:30

Export record

Contributors

Author: Francesco Carrabs
Author: Raffaele Cerulli
Author: Monica Gentili
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×