An Efficient Local Search for the Feedback Vertex Set Problem
AbstractInspired 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.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Zhang, Z.; Ye, A.; Zhou, X.; Shao, Z. An Efficient Local Search for the Feedback Vertex Set Problem. Algorithms 2013, 6, 726-746.
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.