PACE solver description: arcee

DOI10.4230/LIPICS.IPEC.2024.33MaRDI QIDQ7255475zbMATH OpenFDO

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

Publication date 29 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2024.33

zbMATH Keywords

OCMone-sided crossing minimizationPACE 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
• An effective and simple heuristic for the set covering problem
• An exact method for the minimum feedback arc set problem
• Edge crossings in drawings of bipartite graphs
• Fixed parameter algorithms for one-sided crossing minimization revisited
• On the one-sided crossing minimization in a bipartite graph with large degrees
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization

This page was built for publication: PACE solver description: arcee

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255475)