most citedFast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

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…