English

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team

Data Structures and Algorithms 2024-12-03 v1
Authors: Michael Jünger , Paul J. Jünger , Petra Mutzel , Gerhard Reinelt
View on arXiv ↗ PDF ↗

Abstract

This is a short description of our solver OSCM submitted by our team MPPEG to the PACE 2024 challenge both for the exact track and the parameterized track, available at https://github.com/pauljngr/PACE2024 and https://doi.org/10.5281/zenodo.11546972.

Cite

@article{arxiv.2412.00292,
  title  = {PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team},
  author = {Michael Jünger and Paul J. Jünger and Petra Mutzel and Gerhard Reinelt},
  journal= {arXiv preprint arXiv:2412.00292},
  year   = {2024}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Arcee: An OCM-Solver
Kimon Boehmer, Lukas Lee George, Fanny Hauser, Jesse Palarus
2024-11-28
Data Structures and Algorithms · Computer Science
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash
2019-08-21
Distributed, Parallel, and Cluster Computing · Computer Science
Parallel Algorithms for the One Sided Crossing Minimization Problem
Bogdan-Ioan Popa, Adrian-Marius Dumitran, Livia Magureanu
2025-09-30
Optimization and Control · Mathematics
Optimized adaptive MPC for lateral control of autonomous vehicles
Yassine Kebbati, Vicenç Puig, Naima Ait-Oufroukh, Vincent Vigneron +1
2025-09-23
Cryptography and Security · Computer Science
A Verifiable Multiparty Computation Solver for the Assignment Problem and Applications to Air Traffic Management
Thomas Loruenser, Florian Wohner, Stephan Krenn
2022-05-09
Data Structures and Algorithms · Computer Science
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
Martin Fink, Sergey Pupyrev
2013-06-19
Data Structures and Algorithms · Computer Science
weberknecht -- a One-Sided Crossing Minimization solver
Johannes Rauch
2024-12-10
Data Structures and Algorithms · Computer Science
Cutwidth and Crossings
Johannes Rauch, Dieter Rautenbach
2025-01-20
Artificial Intelligence · Computer Science
Benchmark for CEC 2024 Competition on Multiparty Multiobjective Optimization
Wenjian Luo, Peilan Xu, Shengxiang Yang, Yuhui Shi
2024-02-06
Discrete Mathematics · Computer Science
PACE Solver Description: A Heuristic Directed Feedback Vertex Set Problem Algorithm
Andrei Arhire, Paul Diac
2023-01-31
Optimization and Control · Mathematics
On Solving the Shortest Paths with Exclusive-Disjunction Arc Pairs Conflicts
Roberto Montemanni, Derek H. Smith
2025-06-05
Optimization and Control · Mathematics
On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs
Roberto Montemanni, Derek H. Smith
2025-04-22
Computational Geometry · Computer Science
Computing Nonsimple Polygons of Minimum Perimeter
Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann +7
2016-03-24
Data Structures and Algorithms · Computer Science
Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set
Alex Meiburg
2022-08-03
Distributed, Parallel, and Cluster Computing · Computer Science
PACE Solver Description: twin_width_fmi
David Balaban, Adrian Miclăuş
2025-11-18
Data Structures and Algorithms · Computer Science
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time
Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi +1
2021-07-14
Discrete Mathematics · Computer Science
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Nour ElHouda Tellache, Roberto Baldacci
2025-01-17
Computer Vision and Pattern Recognition · Computer Science
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
Andrea Hornakova, Timo Kaiser, Paul Swoboda, Michal Rolinek +2
2021-08-25
Optimization and Control · Mathematics
Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints
Ganzhao Yuan, Bernard Ghanem
2018-12-31
Machine Learning · Computer Science
An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale
Adrián Javaloy, Antonio Vergari
2026-02-17
Optimization and Control · Mathematics
Several classes of stationary points for rank regularized minimization problems
Yulan Liu, Shaohua Pan
2019-06-27
Logic in Computer Science · Computer Science
Compact SAT Encoding for Power Peak Minimization
Tuyen Van Kieu, Phong Chi Nguyen, Bao Gia Hoang, Khanh Van To
2025-12-15
Optimization and Control · Mathematics
On sparse solution of tensor complementarity problem
R. Deb, A. K. Das
2023-04-25
Data Structures and Algorithms · Computer Science
Minimum Path Cover: The Power of Parameterization
Manuel Cáceres, Brendan Mumey, Santeri Toivonen, Alexandru I. Tomescu
2023-08-21
Computational Geometry · Computer Science
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
2022-03-16
R2 v1 2026-06-28T20:17:43.370Z