This document contains a short description of our solver pingpong for the one-sided crossing minimization problem that we submitted to the exact and parameterized track of the PACE challenge 2024. The solver is based on the well-known reduction to the weighted directed feedback arc set problem. This problem is tackled by an implicit hitting set formulation using an integer linear programming solver. Adding hitting set constraints is done iteratively by computing heuristic solutions to the current formulation and finding cycles that are not yet "hit." The procedure terminates if the exact hitting set solution covers all cycles. Thus, optimality of our solver is guaranteed.
@InProceedings{bannach_et_al:LIPIcs.IPEC.2024.28, author = {Bannach, Max and Chudigiewitsch, Florian and Klein, Kim-Manuel and Wien\"{o}bst, Marcel}, title = {{PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization}}, booktitle = {19th International Symposium on Parameterized and Exact Computation (IPEC 2024)}, pages = {28:1--28:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-353-9}, ISSN = {1868-8969}, year = {2024}, volume = {321}, editor = {Bonnet, \'{E}douard and Rz\k{a}\.{z}ewski, Pawe{\l}}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.28}, URN = {urn:nbn:de:0030-drops-222548}, doi = {10.4230/LIPIcs.IPEC.2024.28}, annote = {Keywords: integer programming, exact algorithms, feedback arc set, crossing minimization} }
Feedback for Dagstuhl Publishing