Approximating -Covering
TA Hartmann, T Janßen - arXiv preprint arXiv:2408.04517, 2024 - arxiv.org
$\delta $-Covering, for some covering range $\delta> 0$, is a continuous facility location
problem on undirected graphs where all edges have unit length. The facilities may be …
problem on undirected graphs where all edges have unit length. The facilities may be …
From Chinese Postman to Salesman and Beyond: Shortest Tour -Covering All Points on All Edges
F Frei, A Ghazy, TA Hartmann, F Hörsch… - arXiv preprint arXiv …, 2024 - arxiv.org
A well-studied continuous model of graphs considers each edge as a continuous unit-length
interval of points. For $\delta\geq 0$, we introduce the problem $\delta $-Tour, where the …
interval of points. For $\delta\geq 0$, we introduce the problem $\delta $-Tour, where the …
[PDF][PDF] Facility location on graphs
TA Hartmann, P Rossmanith, D Marx - 2022 - publications.rwth-aachen.de
We study two closely related Facility Location problems on graphs where all edges have unit
length and where the facilities may also be positioned in the interior of the edges. For δ …
length and where the facilities may also be positioned in the interior of the edges. For δ …