On the Fine-Grained Complexity of Approximating k-Center in Sparse Graphs