22 citations · 87 across the 19 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.OC2017
Sinkhorn Algorithm for Lifted Assignment Problems
Yam Kushinsky, Haggai Maron, Nadav Dym +1
Recently, Sinkhorn's algorithm was applied for approximately solving linear programs emerging from optimal transport very efficiently. This was accomplished by formulating a regula…
cs.GR2017★ 10 cited
DS++: A flexible, scalable and provably tight relaxation for matching problems
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…