Covering a Graph with Cycles

, , and

BibTeX reference

This article describes a lower bounding procedure and heuristics for the Cycle Cover Problem which consists of determining a least cost cover of an undirected graph with simple cycles. Applications of this problem arise in network design and in telecommunications. Computational results demonstrate the quality of the proposed heuristics. On 100 vertex graphs, the best of these consistently produces optimal or quasi-optimal solutions.

, 14 pages

This cahier was revised in July 1997

Research Axis

Research application