Approximating maximum weight cycle covers in directed graphs with weights zero and one
- Journal Article
Journal / seriesAlgorithmica
SubjectCombinatorial optimization; Approximation algorithms; Inapproximability; Traveling salesman problem; Cycle covers
NotesReceived 1 November 2003, Revised 5 November 2004, Published online 7 February 2005.
MoreShow all metadata