2026-07-26T03:15:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17385 2024-03-06T10:59:37Z ddc:004 open_access

PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem Du, YuMing Zhang, QingYun Xu, JunZhou Zhang, ShunGen Liao, Chao Chen, ZhiHuai Sun, ZhiBo Su, ZhouXing Ding, JunWen Wu, Chen Lu, PinYan Lv, ZhiPeng directed feedback vertex set local search simulated annealing set covering 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik YuMing Du and QingYun Zhang and JunZhou Xu and ShunGen Zhang and Chao Liao and ZhiHuai Chen and ZhiBo Sun and ZhouXing Su and JunWen Ding and Chen Wu and PinYan Lu and ZhiPeng Lv 2022 Is Part Of LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2022.29 urn:nbn:de:0030-drops-173855 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.29 eng https://creativecommons.org/licenses/by/4.0/legalcode