Document Open Access Logo

PACE Solver Description: Arcee

Authors Kimon Boehmer, Lukas Lee George , Fanny Hauser, Jesse Palarus

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2024.33.pdf
  • Filesize: 0.55 MB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • PACE 2024
  • One-Sided Crossing Minimization
  • OCM

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The 2024 PACE Challenge focused on the One-Sided Crossing Minimization (OCM) problem, which aims to minimize edge crossings in a bipartite graph with a fixed order in one partition and a free order in the other. We describe our OCM solver submission that utilizes various reduction rules for OCM and, for the heuristic track, employs local search approaches as well as techniques to escape local minima. The exact solver uses an ILP formulation and branch & bound to solve an equivalent Feedback Arc Set instance.

Cite As Get BibTex

Kimon Boehmer, Lukas Lee George, Fanny Hauser, and Jesse Palarus. PACE Solver Description: Arcee. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 33:1-33:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.IPEC.2024.33

Author Details

Kimon Boehmer
  • Université Paris-Saclay, France
Lukas Lee George
  • Technical University Berlin, Germany
Fanny Hauser
  • Technical University Berlin, Germany
Jesse Palarus
  • Technical University Berlin, Germany

Acknowledgements

We want to thank Mathias Weller and André Nichterlein for their advice and the Internet Architecture and Management Research Group TU Berlin for their hardware support.

Supplementary Materials

References

  1. Ali Baharev, Hermann Schichl, Arnold Neumaier, and Tobias Achterberg. An exact method for the minimum feedback arc set problem. ACM J. Exp. Algorithmics, 26:1.4:1-1.4:28, 2021. URL: https://doi.org/10.1145/3446429.
  2. Kimon Boehmer, Lukas Lee George, Fanny Hause, and Jesse Palarus. Arcee, June 2024. Software, (visited on 2024-11-27). URL: https://github.com/lucidLuckylee/pace_2024
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.22579
  3. Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva, Antonia Chmiela, João Dionísio, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Mohammed Ghannam, Ambros Gleixner, Christoph Graczyk, Katrin Halbig, Ivo Hedtke, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Dominik Kamp, Thorsten Koch, Kevin Kofler, Jurgen Lentz, Julian Manns, Gioni Mexi, Erik Mühmer, Marc E. Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Lixing Xu. The SCIP Optimization Suite 9.0. Technical report, Optimization Online, February 2024. URL: https://optimization-online.org/2024/02/the-scip-optimization-suite-9-0/.
  4. Vida Dujmovic, Henning Fernau, and Michael Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms, 6(2):313-323, 2008. URL: https://doi.org/10.1016/J.JDA.2006.12.008.
  5. Peter Eades and Nicholas C Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379-403, 1994. URL: https://doi.org/10.1007/BF01187020.
  6. Michael Jünger and Petra Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. In Graph algorithms and applications i, pages 3-27. World Scientific, 2002. Google Scholar
  7. Yasuaki Kobayashi and Hisao Tamaki. A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. Algorithmica, 72(3):778-790, 2015. URL: https://doi.org/10.1007/S00453-014-9872-X.
  8. Pichayapan Kongpanna, Deenesh K. Babi, Varong Pavarajarn, Suttichai Assabumrungrat, and Rafiqul Gani. Systematic methods and tools for design of sustainable chemical processes for co_2 utilization. Comput. Chem. Eng., 87:125-144, 2016. URL: https://doi.org/10.1016/J.COMPCHEMENG.2016.01.006.
  9. Guanghui Lan, Gail W. DePuy, and Gary E. Whitehouse. An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res., 176(3):1387-1403, 2007. URL: https://doi.org/10.1016/J.EJOR.2005.09.028.
  10. Marius Lindauer, Katharina Eggensperger, Matthias Feurer, André Biedenkapp, Difan Deng, Carolin Benjamins, Tim Ruhkopf, René Sass, and Frank Hutter. Smac3: A versatile bayesian optimization package for hyperparameter optimization. Journal of Machine Learning Research, 23(54):1-9, 2022. URL: http://jmlr.org/papers/v23/21-0888.html.
  11. Christian Matuszewski, Robby Schönfeld, and Paul Molitor. Using sifting for k -layer straightline crossing minimization. In Jan Kratochvíl, editor, Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, volume 1731 of Lecture Notes in Computer Science, pages 217-224. Springer, 1999. URL: https://doi.org/10.1007/3-540-46648-7_22.
  12. Hiroshi Nagamochi. On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci., 332(1-3):417-446, 2005. URL: https://doi.org/10.1016/J.TCS.2004.10.042.
  13. TK Pho and L Lapidus. Topics in computer-aided design: Part i. an optimum tearing algorithm for recycle systems. AIChE Journal, 19(6):1170-1181, 1973. Google Scholar
  14. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of 1993 International Conference on Computer Aided Design (ICCAD), pages 42-47, 1993. URL: https://doi.org/10.1109/ICCAD.1993.580029.
  15. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern., 11(2):109-125, 1981. URL: https://doi.org/10.1109/TSMC.1981.4308636.
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