Dispersing Obnoxious Facilities on a Graph

DOI10.4230/LIPIcs.STACS.2019.33OpenAlexW2901078510MaRDI QIDQ5090483

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

Publication date: 18 July 2022

Full work available at URL: https://doi.org/10.4230/lipics.stacs.2019.33

zbMATH Keywords

optimizationcomplexityalgorithmsgraph theoryfacility location

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Continuous Facility Location on Graphs ⋮ Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem

Cites Work

• Unnamed Item
• Unnamed Item
• Maximizing the number of obnoxious facilities to locate within a bounded region
• Matching theory
• On submodular function minimization
• Analytical models for locating undesirable facilities
• Geometric algorithms and combinatorial optimization
• New Results on the Complexity of p-Centre Problems
• Obnoxious Facility Location on Graphs
• Paths, Trees, and Flowers

This page was built for publication: Dispersing Obnoxious Facilities on a Graph