Abstract
We study a continuous facility location problem on undirected graphs where all edges have unit length and where the facilities may be positioned at the vertices as well as at interior points of the edges. The goal is to cover the entire graph with a minimum number of facilities with covering range \(\delta >0\). In other words, we want to position as few facilities as possible subject to the condition that every point on every edge is at distance at most \(\delta \) from one of these facilities.
We investigate this covering problem in terms of the rational parameter \(\delta \). We prove that the problem is polynomially solvable whenever \(\delta \) is a unit fraction, and that the problem is NP-hard for all non unit fractions \(\delta \). We also analyze the parametrized complexity with the solution size as parameter: The resulting problem is fixed parameter tractable for all \(\delta <3/2\), and it is W[2]-hard for all \(\delta \ge 3/2\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer Series in Operations Research. Springer, New York (1995)
Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)
Fekete, S.P., Mitchell, J.S.B., Beurer, K.: On the continuous Fermat-Weber problem. Oper. Res. 53, 61–76 (2005)
Gallai, T.: Kritische graphen II. Magyar Tudományos Akadémia Matematikai Kutat’o Intézetének közleményei 8, 373–395 (1963)
Gallai, T.: Maximale Systeme unabhn̈giger Kanten. Magyar Tudományos Akadémia Matematikai Kutat’o Intézetének közleményei 9, 401–413 (1964)
Grigoriev, A., Hartmann, T.A., Lendl, S., Woeginger, G.J.: Dispersing obnoxious facilities on a graph. In: Proceedings of the 36th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2019), Leibniz International Proceedings in Informatics, LIPICS, vol. 126, pp. 33:1–33:11 (2019)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, part I. The \(p\)-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
Megiddo, N., Tamir, A.: New results on the complexity of \(p\)-center problems. SIAM J. Comput. 12, 751–758 (1983)
Mirchandani, P.B., Francis, R.L.: Discrete Location Theory. Wiley, New York (1990)
Acknowledgement
Stefan Lendl acknowledges support by the Austrian Science Fund (FWF): W1230, Doctoral Program “Discrete Mathematics”. Gerhard Woeginger acknowledges support by the DFG RTG 2236 “UnRAVeL”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Hartmann, T.A., Lendl, S., Woeginger, G.J. (2020). Continuous Facility Location on Graphs. In: Bienstock, D., Zambelli, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2020. Lecture Notes in Computer Science(), vol 12125. Springer, Cham. https://doi.org/10.1007/978-3-030-45771-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-45771-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45770-9
Online ISBN: 978-3-030-45771-6
eBook Packages: Computer ScienceComputer Science (R0)