Estimating metric TSP cost below factor 2 with sublinear queries

Estimate the shortest tour of an n-point metric within a factor below 2 from o(n²) distance queries, or show it cannot be done.