Sciweavers

Share
CORR
2006
Springer
164views Education» more  CORR 2006»
8 years 7 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
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
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
9 years 23 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
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
9 years 23 days ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...
books