An efficient local search for the feedback vertex set problem (Q1736593)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient local search for the feedback vertex set problem |
scientific article |
Statements
An efficient local search for the feedback vertex set problem (English)
0 references
26 March 2019
0 references
Summary: 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 DIMACS benchmarks.
0 references
feedback vertex set
0 references
local search
0 references
variable depth search
0 references
heuristic
0 references