Next: MINIMUM CUT COVER
Up: Covering and Partitioning
Previous: MINIMUM COMPLETE BIPARTITE SUBGRAPH
A family F of vertex disjoint cycles covering V.
Number of cycles in F.
- Bad News:
Not in APX .
Variation in which the graph G is directed is not in APX.
Same results are known for covering with edge disjoint cycles. .