2 citations · 5 across the 12 of their papers we have counts for
Showing 2007 · cs.DSShow all
2 papers · 2 filters
cs.DS2007
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…
cs.DS2007★ 1 cited
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…