License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.55
URN: urn:nbn:de:0030-drops-168536
Go to the corresponding LIPIcs Volume Portal

Hartmann, Tim A. ; Lendl, Stefan

Dispersing Obnoxious Facilities on Graphs by Rounding Distances

LIPIcs-MFCS-2022-55.pdf (0.8 MB)


We continue the study of δ-dispersion, a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that every two facilities have distance at least δ from each other.
Our main technical contribution is an efficient procedure to "round-up" distance δ. It transforms a δ-dispersed set S into a δ^⋆-dispersed set S^⋆ of same size where distance δ^⋆ is a potentially slightly larger rational a/b with a numerator a upper bounded by the longest (not-induced) path in the input graph.
Based on this rounding procedure and connections to the distance-d independent set problem we derive a number of algorithmic results. When parameterized by treewidth, the problem is in XP. When parameterized by treedepth the problem is FPT and has a matching lower bound on its time complexity under ETH. Moreover, we can also settle the parameterized complexity with the solution size as parameter using our rounding technique: δ-Dispersion is FPT for every δ ≤ 2 and W[1]-hard for every δ > 2.
Further, we show that δ-dispersion is NP-complete for every fixed irrational distance δ, which was left open in a previous work.

BibTeX - Entry

  author =	{Hartmann, Tim A. and Lendl, Stefan},
  title =	{{Dispersing Obnoxious Facilities on Graphs by Rounding Distances}},
  booktitle =	{47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
  pages =	{55:1--55:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-256-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{241},
  editor =	{Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-168536},
  doi =		{10.4230/LIPIcs.MFCS.2022.55},
  annote =	{Keywords: facility location, parameterized complexity, packing}

Keywords: facility location, parameterized complexity, packing
Collection: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Issue Date: 2022
Date of publication: 22.08.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI