22 citations · 47 across the 35 of their papers we have counts for
Showing 2017 · math.OCShow all
2 papers · 2 filters
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…
math.OC2017
Exact Recovery with Symmetries for the Doubly-Stochastic Relaxation
Nadav Dym
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the…