@misc {26376,
	title = {A distributed - memory parallel approximation of maximum weight perfect bipartite matching},
	howpublished = {Pacific Northwest National Laboratory, Richland, WA, USA},
	year = {2018},
	abstract = {We discuss efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that covers all vertices and has maximumweight. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by finding good pivots in scalable sparse direct solvers beforefactorization where sequential implementations of maximum weight perfect matching algorithms, are generally used due to the lack of scalable alternatives. To overcome this limitation, we propose a parallel distributed memoryalgorithm and discuss its approximation properties.},
	author = {Langguth, Johannes and Azad, Ariful and Buluc, Aydin and Li, Xiaoye and Wang, Xinliang}
}
