Computer Science Graduate Seminar

Thursday, October 06, 2022, 3:00pm

Facility Location on Graphs

  • Tim Hartmann M.Sc. – Chair for Computer Science 1
  • Place: Room 9222, Ahornstr. 55



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 delta-Dispersion the goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance delta from each other. For delta-Covering the goal is to cover the entire graph with the minimum number of facilities; that is, we want to position as few facilities as possible subject to the condition that every point on every edge is at distance at most delta from one of these facilities. We investigate the algorithmic complexity of these problems for every real distance value delta. Further, we explore the complexity of these problems with the solution size as parameter. Finally, we study delta-Dispersion with parameters that measure the complexity of the input graph, such as treewidth, treedepth and neighborhood diversity.


The computer science lecturers invite interested people to join.