2 papers
cs.CG2026
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
Kevin Buchin, Mark Joachim Krallmann, Frank Staals
Let be a set of points in . Our goal is to preprocess to efficiently compute the smallest enclosing disk of the points in that lie inside an axis-alig…
cs.LG2025
Adaptive Resampling with Bootstrap for Noisy Multi-Objective Optimization Problems
Timo Budszuhn, Mark Joachim Krallmann, Daniel Horn
The challenge of noisy multi-objective optimization lies in the constant trade-off between exploring new decision points and improving the precision of known points through resampl…