A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

2005
*
Algorithmica
*

A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Given a complete directed graph with edge weights zero and one, Max-k-DCC(0, 1) is the problem of finding a k-cycle cover with maximum weight. We present a 2 3 approximation algorithm for Max-k-DCC(0, 1) with running time O(n 5/2 ). This algorithm yields a 4 3 approximation algorithm for Min-k-DCC(1, 2) as well.

doi:10.1007/s00453-004-1131-0
fatcat:6rw4rlft3jf7ziwqytqic7kaam