LIPIcs.IPEC.2024.28.pdf
- Filesize: 0.55 MB
- 4 pages
Document
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization
Authors
Max Bannach 
,
Florian Chudigiewitsch ,
Kim-Manuel Klein ,
Marcel Wienöbst
-
Part of:
Volume:
19th International Symposium on Parameterized and Exact Computation (IPEC 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-12-05
File
Document Identifiers
Author Details
Cite As Get BibTex
Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, and Marcel Wienöbst. PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 28:1-28:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.IPEC.2024.28
Abstract
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Integer programming
- Theory of computation → Parameterized complexity and exact algorithms
Keywords
- integer programming
- exact algorithms
- feedback arc set
- crossing minimization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Ali Baharev, Hermann Schichl, Arnold Neumaier, and Tobias Achterberg. An exact method for the minimum feedback arc set problem. Journal of Experimental Algorithmics (JEA), 26:1-28, 2021.
-
Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, Till Tantau, and Marcel Wienöbst. UzL heuristic solver for one-sided crossing minimization. Technical report, University of Lübeck, 2024.
- Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno- Centeno, and Santosh S. Vempala. Algorithms for implicit hitting set problems. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pages 614-629, 2011. URL: https://doi.org/10.1137/1.9781611973082.48.
- Edsger W Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269-271, 1959. URL: https://doi.org/10.1007/BF01386390.
- Martin Grötschel, Michael Jünger, and Gerhard Reinelt. A cutting plane algorithm for the linear ordering problem. Operations research, 32(6):1195-1220, 1984. URL: https://doi.org/10.1287/OPRE.32.6.1195.
- Qi Huangfu and JA Julian Hall. Parallelizing the dual revised simplex method. Mathematical Programming Computation, 10(1):119-142, 2018. URL: https://doi.org/10.1007/S12532-017-0130-5.