Approximating $\hat{I}´$-Covering

Tim A. Hartmann, Tom Janßen

$\hat{I}´$-Covering, for some covering range $\hat{I}´>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on…