13 citations · 17 across the 5 of their papers we have counts for
1 paper · 1 filter
Marek Karpinski, Richard Schmied
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the be…