1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
cs.CC2006
The approximability of MAX CSP with fixed-value constraints
Vladimir Deineko, Peter Jonsson, Mikael Klasson +1
In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to a…