2026-07-21T19:59:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25172 2026-02-09T08:18:12Z ddc:004 open_access

PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem Luo, Canhui Zhang, Qingyun Su, Zhouxing Lü, Zhipeng PACE 2025 Dominating Set Hitting Set Heuristic Optimization Weighted Local Search We present a unified heuristic solver for the PACE 2025 challenge, addressing both the dominating set and hitting set problems by reducing them to the unicost set covering problem. Our solver applies standard reduction rules, a multi-round frequency-based greedy initializer, and a local search guided by adaptive element weights. Additional techniques, such as component-level exact solving and swap restriction, further enhance performance. In the final official evaluation, our proposed solver achieved second place in the heuristic track for the dominating set problem of the PACE 2025 challenge, while securing first place in the heuristic track for the hitting set problem. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Canhui Luo and Qingyun Zhang and Zhouxing Su and Zhipeng Lü 2025 Is Part Of LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2025.40 urn:nbn:de:0030-drops-251728 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.40 eng https://creativecommons.org/licenses/by/4.0/legalcode