Title of article
Minimum-weight cycle covers and their approximability Original Research Article
Author/Authors
Bodo Manthey، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
1470
To page
1480
Abstract
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An image-cycle cover is a cycle cover in which the length of every cycle is in the set image.
Keywords
Approximation algorithms , Inapproximability , Cycle covers , Non-constructive algorithms
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887076
Link To Document