3 papers
cs.RO2025
Multi-Covering a Point Set by Disks with Minimum Total Area
Mariem Guitouni, Chek-Manh Loi, Sándor P. Fekete +2
A common robotics sensing problem is to place sensors to robustly monitor a set of assets, where robustness is assured by requiring asset to be monitored by at least sen…
cs.SE2025
How Low Can We Go? Minimizing Interaction Samples for Configurable Systems
Dominik Krupke, Ahmad Moradi, Michael Perk +5
Modern software systems are typically configurable, a fundamental prerequisite for wide applicability and reusability. This flexibility poses an extraordinary challenge for quality…
cs.CG2022
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
Sándor P. Fekete, Dominik Krupke, Michael Perk +2
For a given polygonal region , the Lawn Mowing Problem (LMP) asks for a shortest tour that gets within Euclidean distance 1 of every point in ; this is equivalent to comp…