eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-12-14
29:1
29:3
10.4230/LIPIcs.IPEC.2022.29
article
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem
Du, YuMing
1
Zhang, QingYun
1
Xu, JunZhou
2
Zhang, ShunGen
1
Liao, Chao
2
Chen, ZhiHuai
2
Sun, ZhiBo
1
Su, ZhouXing
1
Ding, JunWen
1
Wu, Chen
2
Lu, PinYan
2
Lv, ZhiPeng
1
School of Computer Science and Technology, Huazhong University of Science & Technology, China
Huawei TCS Lab Shanghai, China
A directed graph is formed by vertices and arcs from one vertex to another. The feedback vertex set problem (FVSP) consists in making a given directed graph acyclic by removing as few vertices as possible. In this write-up, we outline the core techniques used in the heuristic feedback vertex set algorithm, submitted to the heuristic track of the 2022 PACE challenge.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol249-ipec2022/LIPIcs.IPEC.2022.29/LIPIcs.IPEC.2022.29.pdf
directed feedback vertex set
local search
simulated annealing
set covering