2 papers
cs.CG2024
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
Simon Bartlmae, Paul J. Jünger, Elmar Langetepe
The Euclidean Steiner Tree Problem (EST) seeks a minimum-cost tree interconnecting a given set of terminal points in the Euclidean plane, allowing the use of additional intersectio…
cs.DS2024
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
Alexander Dobler, Michael Jünger, Paul J. Jünger +3
Storyline drawings are a popular visualization of interactions of a set of characters over time, e.g., to show participants of scenes in a book or movie. Characters are represented…