Before revision:  The k-center problem has recently been shown to be NP-hard, even in the case where k=1, i.e. the minimum enclosing ball under the Fr\'echet distance .
After revision:  Building upon recent hardness results for the minimum-enclosing-ball problem under the Fr\'echet distance .