DS++: a flexible, scalable and provably tight relaxation for matching problems

Nadav Dym, Haggai Maron, Yaron Lipman. DS++: a flexible, scalable and provably tight relaxation for matching problems. ACM Trans. Graph., 36(6), 2017. [doi]

Abstract

Abstract is missing.