Search Results

Documents authored by Luo, Canhui

Artifact
Software
DOI: 10.4230/artifacts.25227
lxily/PACE2025.DS-HS

Authors: Canhui Luo

Abstract
Cite as

Canhui Luo. lxily/PACE2025.DS-HS (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-25227,
   title = {{lxily/PACE2025.DS-HS}}, 
   author = {Luo, Canhui},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:ae6eed6e943ad358e44567283df25ea7123a5fc7;origin=https://github.com/lxily/PACE2025.DS-HS;visit=swh:1:snp:95a8e21ed2c0b36b733ed98364c1e6143cdf4d6d;anchor=swh:1:rev:a7574ce8beace02298ca75535458af1ab47019c1}{\texttt{swh:1:dir:ae6eed6e943ad358e44567283df25ea7123a5fc7}} (visited on 2025-12-15)},
   url = {https://github.com/lxily/PACE2025.DS-HS},
   doi = {10.4230/artifacts.25227},
}
Document
PACE Solver Description
DOI: 10.4230/LIPIcs.IPEC.2025.40
PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem

Authors: Canhui Luo, Qingyun Zhang, Zhouxing Su, and Zhipeng Lü

Published in: LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025)

Abstract
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.
Cite as

Canhui Luo, Qingyun Zhang, Zhouxing Su, and Zhipeng Lü. PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 40:1-40:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{luo_et_al:LIPIcs.IPEC.2025.40,
  author =	{Luo, Canhui and Zhang, Qingyun and Su, Zhouxing and L\"{u}, Zhipeng},
  title =	{{PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem}},
  booktitle =	{20th International Symposium on Parameterized and Exact Computation (IPEC 2025)},
  pages =	{40:1--40:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-407-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{358},
  editor =	{Agrawal, Akanksha and van Leeuwen, Erik Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.40},
  URN =		{urn:nbn:de:0030-drops-251728},
  doi =		{10.4230/LIPIcs.IPEC.2025.40},
  annote =	{Keywords: PACE 2025, Dominating Set, Hitting Set, Heuristic Optimization, Weighted Local Search}
}
Document
CG Challenge
DOI: 10.4230/LIPIcs.SoCG.2024.86
A General Heuristic Approach for Maximum Polygon Packing (CG Challenge)

Authors: Canhui Luo, Zhouxing Su, and Zhipeng Lü

Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)

Abstract
This work proposes a general heuristic packing approach to address the Maximum Polygon Packing Problem introduced by the CG:SHOP 2024 Challenge. Our solver primarily consists of two steps: (1) Partitioning the container and polygons to form a series of small-scale subproblems; (2) For each subproblem, sequentially placing polygons into the container and attempting to eliminate overlaps.
Cite as

Canhui Luo, Zhouxing Su, and Zhipeng Lü. A General Heuristic Approach for Maximum Polygon Packing (CG Challenge). In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 86:1-86:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{luo_et_al:LIPIcs.SoCG.2024.86,
  author =	{Luo, Canhui and Su, Zhouxing and L\"{u}, Zhipeng},
  title =	{{A General Heuristic Approach for Maximum Polygon Packing}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{86:1--86:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.86},
  URN =		{urn:nbn:de:0030-drops-200315},
  doi =		{10.4230/LIPIcs.SoCG.2024.86},
  annote =	{Keywords: packing, polygon, heuristic, differential evolution, local search, tabu search}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact