• We show how to efficiently parallelize the algorithm while preserving approximation guarantees.
previous work (Ravi et al., 2010a;Ravi et al., 2010b) recognized this challenge and employed two phase heuristic approaches.