22 citations · 47 across the 34 of their papers we have counts for
1 paper · 2 filters
Nadav Dym, Haggai Maron, Yaron Lipman
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are t…