Dispersing obnoxious facilities on a graph

Alexander Grigoriev; Tim A. Hartmann; Stefan Lendl; Gerhard J. Woeginger

Dispersing obnoxious facilities on a graph

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

Data Analytics and Digitalisation

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-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 d from each other. We investigate the complexity of this problem in terms of the rational parameter d. The problem is polynomially solvable, if the numerator of is 1 or 2, while all other cases turn out to be NP-hard.

Original language	English
Title of host publication	Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019
Editors	Johann Hurink, Stefan Klootwijk, Bodo Reijnders Manthey, Victor Uiterkamp, Martijn Schoot Uiterkamp
Publisher	University of Twente
Pages	57-60
Number of pages	4
Publication status	Published - 1 Jan 2019
Event	17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization - Enschede, Netherlands Duration: 1 Jul 2019 → 3 Jul 2019 Conference number: 17

Conference

Conference	17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Abbreviated title	CTW 2019
Country/Territory	Netherlands
City	Enschede
Period	1/07/19 → 3/07/19

Access to Document

https://www.ctw.ewi.utwente.nl/CTW2019ProceedingsFinal.pdf

Cite this

Grigoriev, A., Hartmann, T. A., Lendl, S., & Woeginger, G. J. (2019). Dispersing obnoxious facilities on a graph. In J. Hurink, S. Klootwijk, B. R. Manthey, V. Uiterkamp, & M. S. Uiterkamp (Eds.), Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019 (pp. 57-60). University of Twente. https://www.ctw.ewi.utwente.nl/CTW2019ProceedingsFinal.pdf

@inproceedings{605469e366414aee97583dd7b10a812b,

title = "Dispersing obnoxious facilities on a graph",

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 d from each other. We investigate the complexity of this problem in terms of the rational parameter d. The problem is polynomially solvable, if the numerator of is 1 or 2, while all other cases turn out to be NP-hard.",

author = "Alexander Grigoriev and Hartmann, {Tim A.} and Stefan Lendl and Woeginger, {Gerhard J.}",

note = "Publisher Copyright: {\textcopyright} Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019.; 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019 ; Conference date: 01-07-2019 Through 03-07-2019",

year = "2019",

month = jan,

day = "1",

language = "English",

pages = "57--60",

editor = "Johann Hurink and Stefan Klootwijk and Manthey, {Bodo Reijnders} and Victor Uiterkamp and Uiterkamp, {Martijn Schoot}",

booktitle = "Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019",

publisher = "University of Twente",

}

Grigoriev, A, Hartmann, TA, Lendl, S & Woeginger, GJ 2019, Dispersing obnoxious facilities on a graph. in J Hurink, S Klootwijk, BR Manthey, V Uiterkamp & MS Uiterkamp (eds), Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. University of Twente, pp. 57-60, 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, 1/07/19. <https://www.ctw.ewi.utwente.nl/CTW2019ProceedingsFinal.pdf>

Dispersing obnoxious facilities on a graph. / Grigoriev, Alexander; Hartmann, Tim A.; Lendl, Stefan et al.
Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019. ed. / Johann Hurink; Stefan Klootwijk; Bodo Reijnders Manthey; Victor Uiterkamp; Martijn Schoot Uiterkamp. University of Twente, 2019. p. 57-60.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review

TY - GEN

T1 - Dispersing obnoxious facilities on a graph

AU - Grigoriev, Alexander

AU - Hartmann, Tim A.

AU - Lendl, Stefan

AU - Woeginger, Gerhard J.

N1 - Conference code: 17

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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 d from each other. We investigate the complexity of this problem in terms of the rational parameter d. The problem is polynomially solvable, if the numerator of is 1 or 2, while all other cases turn out to be NP-hard.

AB - 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 d from each other. We investigate the complexity of this problem in terms of the rational parameter d. The problem is polynomially solvable, if the numerator of is 1 or 2, while all other cases turn out to be NP-hard.

M3 - Conference article in proceeding

SP - 57

EP - 60

BT - Proceedings of the 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019

A2 - Hurink, Johann

A2 - Klootwijk, Stefan

A2 - Manthey, Bodo Reijnders

A2 - Uiterkamp, Victor

A2 - Uiterkamp, Martijn Schoot

PB - University of Twente

T2 - 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

Y2 - 1 July 2019 through 3 July 2019

ER -

Dispersing obnoxious facilities on a graph

Abstract

Conference

Access to Document

Fingerprint

Cite this