Dispersing obnoxious facilities on a graph

DOI10.1007/s00453-021-00800-3OpenAlexW3135254218MaRDI QIDQ2032349

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

Publication date: 11 June 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.08918

zbMATH Keywords

optimizationcomplexityalgorithmsgraph theoryfacility location

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items

Continuous facility location on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Improved algorithms for placing undesirable facilities
• OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
• New Results on the Complexity of p-Centre Problems
• Obnoxious Facility Location on Graphs
• Continuous Facility Location on Graphs
• Paths, Trees, and Flowers