For each connected simple graph H on labeled vertices {0,…,9}, use shortest-path distance as a complete metric. Starting at 0, repeatedly visit the nearest unvisited vertex, breaking ties by the smaller label, then return to 0. What is the largest ratio between this tour length and the optimal traveling-salesperson tour length?