Metric-Based Graph Problems Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover

Metric-based graph problems in NP, such as Metric Dimension, Strong Metric Dimension, and Geodetic Set, admit double-exponential lower bounds in the treewidth or vertex cover number of the input graph, unless the Exponential Time Hypothesis fails.