Sciweavers

Share
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
9 years 22 days ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
WG
2007
Springer
9 years 1 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
books