1 paper · 1 filter
Amber Q Chen, Kevin K. H. Cheung, P. Michael Kielstra +1
In 2016, Chandrasekaran, Végh, and Vempala published a method to solve the minimum-cost perfect matching problem on an arbitrary graph by solving a strictly polynomial number of li…