# The Parameterized Hardness of the k-Center Problem in Transportation Networks

@article{Feldmann2018ThePH,
title={The Parameterized Hardness of the k-Center Problem in Transportation Networks},
author={A. Feldmann and D. Marx},
journal={ArXiv},
year={2018},
volume={abs/1802.08563}
}
• Published 2018
• Computer Science, Mathematics
• ArXiv
• In this paper we study the hardness of the $k$-Center problem on inputs that model transportation networks. For the problem, an edge-weighted graph $G=(V,E)$ and an integer $k$ are given and a center set $C\subseteq V$ needs to be chosen such that $|C|\leq k$. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications of logistics, and thus it is natural to consider inputs that model transportation networks. Such inputs… CONTINUE READING