Two approximation algorithms for bipartite matching on multicore architectures


We propose two heuristics for the bipartite matching problem that are amenable to shared-memory parallelization. The first heuristic is very intriguing from a parallelization perspective. It has no significant algorithmic synchronization overhead and no conflict resolution is needed across threads. We show that this heuristic has an approximation ratio of… (More)
DOI: 10.1016/j.jpdc.2015.06.009


14 Figures and Tables