CORR

2006

Springer

13 years 6 months ago
2006

Springer

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 ...

WAOA

2005

Springer

13 years 11 months ago
2005

Springer

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...

WADS

2005

Springer

13 years 11 months ago
2005

Springer

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 â...