Dispersing obnoxious facilities on a graph

DOI10.1007/S00453-021-00800-3MaRDI QIDQ2032349zbMATH OpenOpenAlexFDO

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

Publication date 11 June 2021

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

algorithmscomplexityfacility locationgraph theoryoptimization

Mathematics Subject Classification ID

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

Recommendations

• Obnoxious Facility Location on Graphs
• scientific article; zbMATH DE number 2111731
• Continuous facility location on graphs
• Continuous facility location on graphs
• Location Of A Tree Shaped Facility In A Network

Cites work

• Analytical models for locating undesirable facilities
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Continuous facility location on graphs
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2111731 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• Improved algorithms for placing undesirable facilities
• Matching theory
• Maximizing the number of obnoxious facilities to locate within a bounded region
• New Results on the Complexity of p-Centre Problems
• Obnoxious Facility Location on Graphs
• Obnoxious facility location: complete service with minimal harm
• On submodular function minimization
• Paths, Trees, and Flowers

Cited in

(8)

• Discrete facility location and routing of obnoxious activities.
• Continuous facility location on graphs
• Obnoxious Facility Location on Graphs
• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
• Continuous facility location on graphs
• Dispersing Obnoxious Facilities on a Graph
• From Chinese postman to salesman and beyond: shortest tour -covering all points on all edges
• Independence and domination on bounded-treewidth graphs: integer, rational, and irrational distances

This page was built for publication: Dispersing obnoxious facilities on a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032349)