2 papers
cs.DS2024
Approximating -Covering
Tim A. Hartmann, Tom Janßen
-Covering, for some covering range , is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on th…
math.CO2023
Make a graph singly connected by edge orientations
Tim A. Hartmann, Komal Muluk
A directed graph is singly connected if for every ordered pair of vertices , there is at most one path from to in . Graph orientation problems ask, given an u…