y
Download:
|
|
by Alberto Caprara, Alessandro Panconesi, Romeo Rizzi
http://www.or.deis.unibo.it/alberto/cycpack_fin.ps
Add To MetaCart
Abstract:
Given an undirected graph G with n nodes and m edges, we address the problem of nding a largest collection of edge-disjoint cycles in G. The problem, dubbed Cycle Packing, is very closely related to a few genome rearrangement problems in computational biology. In this paper, we study the complexity and approximability of Cycle Packing, about which very little is known although it is natural and has practical applications. We show that the problem is APX-hard but can be approximated within a factor of O(log n) by a simple greedy approach. We do not know whether the O(log n) factor is tight, but we give a nontrivial example for which the ratio achieved by greedy is not constant, namely
