2 citations · 3 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics
Vladimir Shenmaier
The maximum traveling salesman problem (Max~TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. We prove tha…
cs.DS2020★ 2 cited
Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension
Vladimir Shenmaier
The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given complete weighted graph. This problem…