Abstract
We address the problem of approximating aminimum cycle cover in parallel. We give the first efficient parallel algorithm for finding an approximation to aminimum cycle cover. Our algorithm finds a cycle cover whose size is within a factor of 0(1 +n logn/(m + n) of the minimum-sized cover usingO(log2n) time on (m + n)/logn processors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have