Next Article in Journal
Previous Article in Journal
Algorithms 2013, 6(4), 726-746; doi:10.3390/a6040726
Article

An Efficient Local Search for the Feedback Vertex Set Problem

1,2
, 1,2,* , 1,2
 and 1,2
Received: 24 June 2013; in revised form: 7 August 2013 / Accepted: 28 October 2013 / Published: 1 November 2013
Download PDF [201 KB, updated 6 November 2013; original version uploaded 1 November 2013]
Abstract: Inspired by many deadlock detection applications, the feedback vertex set is defined as a set of vertices in an undirected graph, whose removal would result in a graph without cycle. The Feedback Vertex Set Problem, known to be NP-complete, is to search for a feedback vertex set with the minimal cardinality to benefit the deadlock recovery. To address the issue, this paper presents NewkLS FVS(LS, local search; FVS, feedback vertex set), a variable depth-based local search algorithm with a randomized scheme to optimize the efficiency and performance. Experimental simulations are conducted to compare the algorithm with recent metaheuristics, and the computational results show that the proposed algorithm can outperform the other state-of-art algorithms and generate satisfactory solutions for most DIMACSbenchmarks.
Keywords: feedback vertex set; local search; variable depth search; heuristic feedback vertex set; local search; variable depth search; heuristic
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Zhang, Z.; Ye, A.; Zhou, X.; Shao, Z. An Efficient Local Search for the Feedback Vertex Set Problem. Algorithms 2013, 6, 726-746.

AMA Style

Zhang Z, Ye A, Zhou X, Shao Z. An Efficient Local Search for the Feedback Vertex Set Problem. Algorithms. 2013; 6(4):726-746.

Chicago/Turabian Style

Zhang, Zhiqiang; Ye, Ansheng; Zhou, Xiaoqing; Shao, Zehui. 2013. "An Efficient Local Search for the Feedback Vertex Set Problem." Algorithms 6, no. 4: 726-746.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert