Abstract
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. © YuMing Du, QingYun Zhang, JunZhou Xu, ShunGen Zhang, Chao Liao, ZhiHuai Chen, ZhiBo Sun, ZhouXing Su, JunWen Ding, Chen Wu, PinYan Lu, and ZhiPeng Lv.
| Original language | English |
|---|---|
| Title of host publication | 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) |
| Editors | Holger Dell, Jesper Nederlof |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Number of pages | 3 |
| ISBN (Print) | 978-3-95977-260-0 |
| DOIs | |
| Publication status | Published - 2022 |
| Externally published | Yes |
| Event | 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) - Potsdam, Germany Duration: 7 Sept 2022 → 9 Sept 2022 https://www.dagstuhl.de/dagpub/978-3-95977-260-0 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 249 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) |
|---|---|
| Place | Germany |
| City | Potsdam |
| Period | 7/09/22 → 9/09/22 |
| Internet address |
Research Keywords
- directed feedback vertex set
- local search
- set covering
- simulated annealing
Publisher's Copyright Statement
- This full text is made available under CC-BY 4.0. https://creativecommons.org/licenses/by/4.0/
Fingerprint
Dive into the research topics of 'PACE Solver Description: Hust-Solver – A Heuristic Algorithm of Directed Feedback Vertex Set Problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver