15 citations · 35 across the 19 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
cs.DS2006
Minimum-weight Cycle Covers and Their Approximability
Bodo Manthey
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…
cs.DS2006
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
Bodo Manthey, L. Shankar Ram
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cann…
cs.DS2006
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
Bodo Manthey
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…