1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Andreas Emil Feldmann, Daniel Marx
In this paper we study the hardness of the k-Center problem on inputs that model transportation networks. For the problem, a graph G=(V,E) with edge lengths and an integer k…