PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
Fuente:
arXiv
Saved in:
| Main Authors: | Jünger, Michael, Jünger, Paul J., Mutzel, Petra, Reinelt, Gerhard |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024)
by: Dobler, Alexander, et al.
Published: (2024)
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
by: Bartlmae, Simon, et al.
Published: (2024)
by: Bartlmae, Simon, et al.
Published: (2024)
TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022)
by: Oettershagen, Lutz, et al.
Published: (2022)
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
by: Beines, Arne, et al.
Published: (2024)
by: Beines, Arne, et al.
Published: (2024)
An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)
by: Münch, Sabine, et al.
Published: (2025)
Accelerating Graph Similarity Search through Integer Linear Programming
by: D'Ascenzo, Andrea, et al.
Published: (2025)
by: D'Ascenzo, Andrea, et al.
Published: (2025)
One-Sided Local Crossing Minimization
by: Giannopoulos, Panos, et al.
Published: (2025)
by: Giannopoulos, Panos, et al.
Published: (2025)
SAT Encoding of Partial Ordering Models for Graph Coloring Problems
by: Faber, Daniel, et al.
Published: (2024)
by: Faber, Daniel, et al.
Published: (2024)
weberknecht -- a One-Sided Crossing Minimization solver
by: Rauch, Johannes
Published: (2024)
by: Rauch, Johannes
Published: (2024)
Parallel Algorithms for the One Sided Crossing Minimization Problem
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
by: Popa, Bogdan-Ioan, et al.
Published: (2025)
An Exact Algorithm for the Unanimous Vote Problem
by: Keles, Feyza Duman, et al.
Published: (2025)
by: Keles, Feyza Duman, et al.
Published: (2025)
Quantum Algorithms for One-Sided Crossing Minimization
by: Caroppo, Susanna, et al.
Published: (2024)
by: Caroppo, Susanna, et al.
Published: (2024)
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
by: Eisenbrand, Friedrich, et al.
Published: (2024)
by: Eisenbrand, Friedrich, et al.
Published: (2024)
Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
by: Horowicz, Noam, et al.
Published: (2025)
by: Horowicz, Noam, et al.
Published: (2025)
A Note on Interdiction of Linear Minimization Problems
by: Cong, Yu, et al.
Published: (2026)
by: Cong, Yu, et al.
Published: (2026)
A Customized SAT-based Solver for Graph Coloring
by: Brand, Timo, et al.
Published: (2025)
by: Brand, Timo, et al.
Published: (2025)
Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem
by: Au, Andrew
Published: (2026)
by: Au, Andrew
Published: (2026)
Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
by: Berg, Magnus
Published: (2024)
by: Berg, Magnus
Published: (2024)
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
by: Haas, Niklas, et al.
Published: (2025)
by: Haas, Niklas, et al.
Published: (2025)
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
by: Murakami, Hitoshi, et al.
Published: (2024)
by: Murakami, Hitoshi, et al.
Published: (2024)
Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)
by: Köppl, Dominik, et al.
Published: (2026)
The Connected k-Vertex One-Center Problem on Graphs
by: Zhang, Jingru
Published: (2024)
by: Zhang, Jingru
Published: (2024)
qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
by: Dhar, Saurav, et al.
Published: (2024)
by: Dhar, Saurav, et al.
Published: (2024)
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
by: Jin, Mingming, et al.
Published: (2023)
by: Jin, Mingming, et al.
Published: (2023)
Free-order secretary for two-sided independence systems
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Minimizing the Minimizers via Alphabet Reordering
by: Verbeek, Hilde, et al.
Published: (2024)
by: Verbeek, Hilde, et al.
Published: (2024)
Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
by: Staus, Luca Pascal, et al.
Published: (2024)
by: Staus, Luca Pascal, et al.
Published: (2024)
Exactly Hittable Interval Graphs
by: Dhannya, S. M., et al.
Published: (2023)
by: Dhannya, S. M., et al.
Published: (2023)
glass: ordered set data structure for client-side order books
by: Krapivensky, Viktor
Published: (2025)
by: Krapivensky, Viktor
Published: (2025)
A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
by: Xie, Ningyi, et al.
Published: (2023)
by: Xie, Ningyi, et al.
Published: (2023)
Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)
by: Balkanski, Eric, et al.
Published: (2024)
Exact Optimization for Minimum Dominating Sets
by: Zhu, Enqiang, et al.
Published: (2025)
by: Zhu, Enqiang, et al.
Published: (2025)
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
by: Buchem, Moritz, et al.
Published: (2024)
by: Buchem, Moritz, et al.
Published: (2024)
A characterization of one-sided error testable graph properties in bounded degeneracy graphs
by: Lachish, Oded, et al.
Published: (2026)
by: Lachish, Oded, et al.
Published: (2026)
Exact Short Products From Truncated Multipliers
by: Lemire, Daniel
Published: (2023)
by: Lemire, Daniel
Published: (2023)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
by: Mo, Guanlin, et al.
Published: (2024)
by: Mo, Guanlin, et al.
Published: (2024)
Engineering Fully Dynamic Exact $Δ$-Orientation Algorithms
by: Großmann, Ernestine, et al.
Published: (2024)
by: Großmann, Ernestine, et al.
Published: (2024)
Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)
by: Schulz, Christian, et al.
Published: (2026)
Similar Items
-
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
by: Dobler, Alexander, et al.
Published: (2024) -
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
by: Bartlmae, Simon, et al.
Published: (2024) -
TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022) -
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
by: Beines, Arne, et al.
Published: (2024) -
An Exact Solver for Submodular Knapsack Problems
by: Münch, Sabine, et al.
Published: (2025)