Dispersing Obnoxious Facilities on a Graph

Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

We study 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 any two facilities have at least distance δ from each other.
We investigate the complexity of this problem in terms of the rational parameter δ. The problem is polynomially solvable, if the numerator of δ is 1 or 2, while all other cases turn out to be NP-hard.
Original languageEnglish
Title of host publication36th International Symposium on Theoretical Aspects of Computer Science
EditorsRolf Niedermeier, Christophe Paul
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Pages33:1-33:11
Number of pages11
Volume126
ISBN (Print)978-3-95977-100-9
DOIs
Publication statusPublished - Mar 2019
EventInternational Symposium on Theoretical Aspects of Computer Science - TU Berlin, Berlin, Germany
Duration: 13 Mar 201916 Mar 2019
Conference number: 36
https://stacs2019.akt.tu-berlin.de/

Publication series

SeriesLeibniz International Proceedings in Informatics
Volume126
ISSN1868-8969

Conference

ConferenceInternational Symposium on Theoretical Aspects of Computer Science
Abbreviated titleSTACS
CountryGermany
CityBerlin
Period13/03/1916/03/19
Internet address

JEL classifications

  • c00 - Mathematical and Quantitative Methods: General
  • c63 - "Computational Techniques; Simulation Modeling"

Keywords

  • Algorithms
  • Complexity
  • Optimization
  • Graph theory
  • Facility location

Cite this