weberknecht -- a One-Sided Crossing Minimization solver
Abstract
We describe the implementation of the exact solver weberknecht and the heuristic solver weberknechth for the One-Sided Crossing Minimization problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.