Continuous facility location on graphs

DOI10.1007/s10107-021-01646-xzbMath1489.90155OpenAlexW4225991975MaRDI QIDQ2118124

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

Publication date: 22 March 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01646-x

zbMATH Keywords

complexitylocation theorycoveringgraph theoryparametrized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Threshold dominating sets and an improved characterization of \(W[2\)]
• Dispersing obnoxious facilities on a graph
• New Results on the Complexity of p-Centre Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Obnoxious Facility Location on Graphs
• Fixed-Parameter Tractability and Completeness I: Basic Results
• On the Continuous Fermat-Weber Problem
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous facility location on graphs