  The k-center problem is a fundamental problem we often face when considering
complex service systems. Typical challenges include the placement of warehouses
in logistics or positioning of servers for content delivery networks. We
previously have proposed Dragoon as an effective algorithm to approach the
k-center problem. This paper evaluates Dragoon with a focus on potential worst
case behavior in comparison to other techniques. We use an evolutionary
algorithm to generate instances of the k-center problem that are especially
challenging for Dragoon. Ultimately, our experiments confirm the previous good
results of Dragoon, however, we also can reliably find scenarios where it is
clearly outperformed by other approaches.
