this is my first question on Theoretical CS. :)
I've posted a similiar question on Mathoverflow and a friendly user advised me to post my question on this site.
Problem:
I'm looking for TSP heuristics in the case of limited information about the edges, for example: I have $n$ nodes but can only ask for $~\sim4n$ distances. My graphs are metric and I can make an estimate in advance with the euclidean distance, which provides a lower bound, but those estimates might be very bad.
Question:
So what are the TSP-Heuristika for those distance-matrices?
Thanks in advance.